Any four independent edges of a 4-connected graph are contained in a circuit

DOI10.1007/BF01955745zbMath0588.05024OpenAlexW2077560266MaRDI QIDQ1073040

Ervin Gyoeri, Péter L. Erdős

Publication date: 1985

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

circuitconnected graphindependent edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (4)

On circuits through five edges ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ Paths and cycles concerning independence edges ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture

Cites Work

• Unnamed Item
• An Erdős-Gallai conjecture
• Circuits through specified edges

This page was built for publication: Any four independent edges of a 4-connected graph are contained in a circuit