On Hamilton circuits and Hamilton paths

DOI10.1007/BF01427952MaRDI QIDQ2547564zbMATH OpenFDO

Authors G. A. Dirac

Publication date 1972

Published in Mathematische Annalen (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/162268

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Paths and circuits in graphs: Extreme cases

Cited in

(7)

• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Colored homomorphisms of colored mixed graphs
• Fractional matching preclusion of product networks
• Colouring even cycle systems
• Note on the spanning-tree packing number of lexicographic product graphs
• Note on Hamilton circuits and Hamilton paths
• Bounds of generalized edge-connectivity of lexicographic product graphs

This page was built for publication: On Hamilton circuits and Hamilton paths

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