The minimal trivalent graphs with given smallest odd cycle

DOI10.1016/0012-365X(85)90113-XzbMath0565.05050MaRDI QIDQ1058528

Péter Kovács

Publication date: 1985

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

zbMATH Keywords

Möbius ladderodd girthminimal trivalent graph

Mathematics Subject Classification ID

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

Related Items (5)

On cages for girth pair \((6,b)\) ⋮ On the order of graphs with a given girth pair ⋮ The face pair of planar graphs ⋮ On a conjecture on the order of cages with a given girth pair ⋮ A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• Graphs with prescribed degree sets and girth
• Parallel concepts in graph theory
• Regular graphs with given girth pair
• On the Möbius Ladders

This page was built for publication: The minimal trivalent graphs with given smallest odd cycle