A generalization of a theorem of Dirac

DOI10.1006/jctb.2001.2041zbMath1025.05039OpenAlexW1971934455MaRDI QIDQ1850552

Tristan Denley, Haidong Wu

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2041

zbMATH Keywords

pathsmatroidcocircuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (5)

Circuits and cocircuits in regular matroids ⋮ Pairs of edges as chords and as cut-edges ⋮ Ore-type and Dirac-type theorems for matroids ⋮ A look at cycles containing specified elements of a graph ⋮ Graphs in which every c edges that form a tree are chords of a common cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Circuits through specified edges
• A matroid generalization of a result of Dirac
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

This page was built for publication: A generalization of a theorem of Dirac