Graphs having circuits with at least two chords

DOI10.1016/0095-8956(82)90004-1zbMath0478.05058OpenAlexW2017552248MaRDI QIDQ1160634

Heinz-Juergen Voss

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90004-1

zbMATH Keywords

chordsodd circuiteven circuits

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (2)

Coloring Graphs with Two Odd Cycle Lengths ⋮ Girth in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-separating induced cycles in graphs
• Some graphs with chromatic number three
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

This page was built for publication: Graphs having circuits with at least two chords