Graphs in which every finite path is contained in a circuit

DOI10.1007/BF01349245MaRDI QIDQ2553449zbMATH OpenFDO

Authors G. A. Dirac, Carsten Thomassen

Publication date 1973

Published in Mathematische Annalen (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites work

• Decomposition of Graphs Into Closed and Endless Chains
• On Arbitrarily Traceable Graphs.
• On randomly Hamiltonian graphs
• Randomly Traceable Graphs

Cited in

(11)

• Relative lengths of paths and cycles in 3-connected graphs
• Edge sets contained in circuits
• On separating cycles in graphs
• Brooks' Theorem and Beyond
• scientific article; zbMATH DE number 4145958 (Why is no real title available?)
• scientific article; zbMATH DE number 4068925 (Why is no real title available?)
• scientific article; zbMATH DE number 90530 (Why is no real title available?)
• On Path-amenable Graphs
• Orientations of infinite graphs with prescribed edge-connectivity
• Extending cycles in graphs
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

This page was built for publication: Graphs in which every finite path is contained in a circuit

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