Funder
China Scholarship Council
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference34 articles.
1. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2000
2. Proof verification and the hardness of approximation problems;Arora;J. AMC,1998
3. Graph Theory;Bondy,2008
4. Max-leaves spanning tree is APX-hard for cubic graphs;Bonsma;J. Discrete Algorithms,2012
5. Graphs with maximum connectivity index;Caporossi;Comput. Biol. Chem.,2003