On circuits through five edges

DOI10.1016/0012-365X(95)00079-CMaRDI QIDQ1126199zbMATH OpenFDO

Authors Daniel P. Sanders

Publication date 22 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

circuitindependent setconjecture

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Any four independent edges of a 4-connected graph are contained in a circuit
• Cycles through five edges in 3-connected cubic graphs
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• Circuits through prescribed edges

Cites work

• scientific article; zbMATH DE number 16299 (Why is no real title available?)
• Any four independent edges of a 4-connected graph are contained in a circuit
• Circuits containing specified edges
• Circuits through specified edges
• Cycles through four edges in 3-connected cubic graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Note on circuits containing specified edges

Cited in

(6)

• Circuits through prescribed edges
• Cycles through five edges in 3-connected cubic graphs
• An Improved Algorithm for Finding Cycles Through Elements
• Any four independent edges of a 4-connected graph are contained in a circuit
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• On consistent families of circuits

This page was built for publication: On circuits through five edges

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