Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. The square of a block is Hamiltonian connected;Chartrand;J. Combinatorial Theory Ser. B,1974
2. Minimally two-connected graphs;Dirac;J. Reine Angew. Math.,1967
3. On the spanning subgraphs of a connected bridgeless graph and their application to DT-graphs;Fleischner;J. Combinatorial Theory Ser. B,1974
4. The square of every two-connected graph is Hamiltonian;Fleischner;J. Combinatorial Theory Ser. B,1974
5. H. Fleischner and A. M. Hobbs, A necessary condition for the square of a graph to be Hamiltonian, J. Combinatorial Theory (to appear).
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献