How many conjectures can you stand? A survey
DOI10.1007/s00373-011-1090-6zbMath1234.05146WikidataQ123359474 ScholiaQ123359474MaRDI QIDQ659764
Zdeněk Ryjáček, Petr Vrána, Hajo J. Broersma
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/how-many-conjectures-can-you-stand-a-survey(82c4edb3-0df3-463d-9242-09c8315c0a07).html
claw-free graph; Hamiltonian graph; cubic graph; line graph; snark; closure; collapsible graph; dominating closed trail; supereulerian graph; Hamilton-connected; dominating cycle; contractible graph; cyclically 4-edge-connected; essentially 4-edge-connected
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C45: Eulerian and Hamiltonian graphs