Edge sets contained in circuits

DOI10.1007/BF02834761zbMath0335.05123OpenAlexW2066375675MaRDI QIDQ1229230

Carsten Thomassen, K. Brooks Reid

Publication date: 1976

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02834761

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Sparsity of graphs that allow two distinct eigenvalues ⋮ Combinatorially orthogonal matrices and related graphs ⋮ Inseparable orthogonal matrices over \(\mathbb{Z}_2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Graphs in which every finite path is contained in a circuit
• Bypasses in asymmetric digraphs
• Cycles of Each Length in Regular Tournaments
• Randomly Traceable Graphs
• A note on K-path hamiltonian graphs

This page was built for publication: Edge sets contained in circuits