Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
2. Hamiltonicity for free K1,r-graphs;Chen;J. Graph Theory,1995
3. Dominating cycles in regular 3-connected graphs;Jackson;Discrete Math.,1991
4. H.A. Jung, Longest cycles in 3-connected graphs, Colloquia Mathematica Societatis Janos Bolyai, vol. 37 Finite and Infinite Sets, Eger, Hungary, 1981, pp. 403-438.
5. Hamiltonian cycles in 2-connected claw-free graphs;Li;J. Graph Theory,1995
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Perfect matchings and K1,p-restricted graphs;Discrete Mathematics and Applications;2020-12-16
2. Perfect matchings in graphs with prescribed local restrictions;Doklady of the National Academy of Sciences of Belarus;2019-09-13
3. Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs;Czechoslovak Mathematical Journal;2019-02-11
4. Note on the longest paths in {K 1,4, K 1,4 + e}-free graphs;Acta Mathematica Sinica, English Series;2012-07-30
5. Hamilton paths in {K1,4,K1,4+e}-free graphs;Discrete Mathematics;2008-09