On circuits through five edges

DOI10.1016/0012-365X(95)00079-CzbMath0864.05054MaRDI QIDQ1126199

Daniel P. Sanders

Publication date: 22 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independent setconjecturecircuit

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

An Improved Algorithm for Finding Cycles Through Elements ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture

Cites Work

• Unnamed Item
• Cycles through four edges in 3-connected cubic graphs
• Any four independent edges of a 4-connected graph are contained in a circuit
• Circuits through specified edges
• Circuits containing specified edges
• Note on circuits containing specified edges
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

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