Pairs of edges as chords and as cut-edges

DOI10.7151/DMGT.1755MaRDI QIDQ472124zbMATH OpenOpenAlexFDO

Authors Terry A. McKee

Publication date 18 November 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

cyclechordcut-edge

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7777274
• Edges and tableaux
• Cut cotorsion pairs
• Edges, stars, superedges and chains
• Edge-cuts leaving components of order at least three
• Cut lattices and equiangular lines
• Corner cuts and their polytopes
• Line segments which are unions of tessellation edges
• Parallel and dual surfaces of cuspidal edges
• Cycles Intersecting Edge-Cuts of Prescribed Sizes

Cites work

• scientific article; zbMATH DE number 2186979 (Why is no real title available?)
• scientific article; zbMATH DE number 3460316 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 5038484 (Why is no real title available?)
• 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

Cited in

(3)

• Edge-cut cycles and cutting numbers of cycles and graphs
• scientific article; zbMATH DE number 3933111 (Why is no real title available?)
• Graphs in which every \(c\) edges that form a tree are chords of a common cycle

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

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