Pairs of edges as chords and as cut-edges

DOI10.7151/DMGT.1755zbMath1303.05102OpenAlexW1997694581MaRDI QIDQ472124

Terry A. McKee

Publication date: 18 November 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1755

zbMATH Keywords

cyclechordcut-edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

Graphs in which every c edges that form a tree are chords of a common cycle

Cites Work

• A generalization of a theorem of Dirac
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Survey of results on \(k\)-ordered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairs of edges as chords and as cut-edges