Graphs such that every two edges are contained in a shortest cycle

DOI10.1016/0012-365X(89)90285-9zbMath0676.05054OpenAlexW2042834150MaRDI QIDQ1122590

N. Homobono, Claudine Peyrat

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90285-9

zbMATH Keywords

shortest cycle

Mathematics Subject Classification ID

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

Related Items (2)

Kissing numbers of regular graphs ⋮ On chromatic uniqueness of uniform subdivisions of graphs

Cites Work

• Cages—a survey
• There is No Irregular Moore Graph
• Graphs with Maximal Even Girth

This page was built for publication: Graphs such that every two edges are contained in a shortest cycle