The minimal trivalent graphs with given smallest odd cycle
type: Item
instance of: scholarly article
title: The minimal trivalent graphs with given smallest odd cycle
zbMATH Open document ID: 0565.05050
DOI: 10.1016/0012-365X(85)90113-X
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
review text: The main result of this paper is the following theorem: Let h be an odd integer with \(h\geq 5\). Then the Möbius ladder of order 2(h-1) is the unique minimal trivalent graph with odd girth h.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3900807
zbMATH Keywords: Möbius ladder
zbMATH Keywords: minimal trivalent graph
zbMATH Keywords: odd girth
author: Péter Kovács
reviewed by: B. Andrasfai
MaRDI profile type: Publication
cites work: Graphs with prescribed degree sets and girth
cites work: On the Möbius Ladders
cites work: Parallel concepts in graph theory
cites work: Regular graphs with given girth pair
description: scientific article; zbMATH DE number 3900807