scientific article; zbMATH DE number 3993619

MaRDI QIDQ4722095zbMATH OpenFDO

Authors Frank Hilbig

Publication date 1986

zbMATH Keywords

Hamilton cycleHamiltonian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 3929043
• scientific article; zbMATH DE number 3966120
• Edge-Hamiltonian property in regular 2-connected graphs
• Maximum graphs non-Hamiltonian-connected from a vertex
• Publication:4726284

Cited in

(13)

• Leaf number and Hamiltonian \(C_4\)-free graphs
• Hamiltonicity in connected regular graphs
• Die Anzahl nicht-isomorpher \(m\)-Graphen
• Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
• Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• A survey on Hamilton cycles in directed graphs
• Some criteria for a graph to be class 1
• Spanning paths and cycles in triangle-free graphs
• Cycle partitions of regular graphs
• Longest cycles in vertex-transitive and highly connected graphs
• An ILP approach to determine smallest 4-regular non-Hamiltonian, nontraceable, and nonhomogeneously traceable graphs
• Estimating the circumference of a graph in terms of its leaf number

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722095)