A generalization of a theorem of Dirac

DOI10.1006/JCTB.2001.2041MaRDI QIDQ1850552zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A matroid generalization of a result of Dirac
• A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
• Circuits and cocircuits in regular matroids
• Ore-type and Dirac-type theorems for matroids
• Paths and edge-connectivity in graphs

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• A matroid generalization of a result of Dirac
• Circuits through specified edges
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

Cited in

(10)

• Pairs of edges as chords and as cut-edges
• Cycles through \(k+2\) vertices in \(k\)-connected graphs
• On one extension of Dirac's theorem on Hamiltonicity
• Circuits and cocircuits in regular matroids
• On a rainbow version of Dirac's theorem
• A look at cycles containing specified elements of a graph
• Circuits through cocircuits in a graph with extensions to matroids
• Ore-type and Dirac-type theorems for matroids
• Graphs in which every \(c\) edges that form a tree are chords of a common cycle
• A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs

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

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