Author:
Chen C.C.,Koh K.M.,Peng Y.H.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Tough graphs and hamiltonian circuits;Chvátal;Discrete Math.,1973
2. Edge-disjoint spanning trees of finite graphs;Nash-Williams;J. London Math. Soc.,1961
3. Decomposition of finite graphs into forests;Nash-Williams;J. London Math. Soc.,1964
4. On the edge-toughness of a graph;Peng;Southeast Asian Bull. of Math.,1988
5. On the problem of decomposing a graph into n connected factors;Tutte;J. London Math. Soc.,1961
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献