Author:
Chartrand G,Hobbs Arthur M,Jung H.A,Kapoor S.F,Nash-Williams C.St.J.A
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. n-Hamiltonian graphs;Chartrand;J. Combinatorial Theory,1970
2. On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs;Fleischner;J. Combinatorial Theory Series B,1974
3. The square of every two-connected graph is Hamiltonian;Fleischner;J. Combinatorial Theory Series B,1974
4. Hamiltonian connected graphs;Ore;J. Math. Pures Appl.,1963
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献