Funder
Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Broersma, H.J.: Problem 2. Workshop Cycles and Colourings (Novy Smokovec, 1993). http://umv.science.upjs.sk/c&c/history/93problems.pdf
2. Brousek, J.: Minimal $$2$$-connected non-Hamiltonian claw-free graphs. Discrete Math. 191, 57–64 (1998)
3. Catlin, P.A.: Supereulerian graphs, collapsible graphs, and four-cycles. Congr. Numer. 58, 233–246 (1987)
4. Catlin, P.A.: A reduction method to find spanning Eulerian subgraphs. J. Graph Theory 12(1), 29–44 (1988)
5. Čada, R., Li, B., Ning, B., Zhang, S.: Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs. Acta Math. Sin. 32(7), 845–855 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献