Graphs in which every finite path is contained in a circuit

DOI10.1007/BF01349245zbMath0239.05129MaRDI QIDQ2553449

Carsten Thomassen, G. A. Dirac

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)

Related Items (11)

Brooks' Theorem and Beyond ⋮ Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests ⋮ Relative lengths of paths and cycles in 3-connected graphs ⋮ On Path-amenable Graphs ⋮ Edge sets contained in circuits ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ On separating cycles in graphs ⋮ Extending cycles in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

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

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