Non-Hamiltonian bicubic graphs
type: Item
instance of: scholarly article
title: Non-Hamiltonian bicubic graphs
zbMATH Open document ID: 0673.05061
DOI: 10.1016/0095-8956(89)90012-9
author: John P. Georges
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: A graph is said to be bicubic if it is bipartite and 3-regular. A graph is said to be cyclically 4-edge connected if any set of edges whose removal separates the graph into two parts both containing circuits, contains at least 3 edges. In the note, a non-Hamiltonian cyclically 4-edge connected bicubic graph of order 50 is constructed. This is the smallest non-Hamiltonian 3- connected bicubic graph known.
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4101245
zbMATH Keywords: bipartite
zbMATH Keywords: 3-regular
zbMATH Keywords: bicubic graph
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90012-9
OpenAlex ID: W2060787934
Wikidata QID: Q56001793
cites work: Q3097395
cites work: Cycles through ten vertices in 3-connected cubic graphs
cites work: Non-Hamiltonian 3-connected cubic bipartite graphs
cites work: On two-factors of bipartite regular graphs
cites work: On the 2-factors of bicubic graphs
description: scientific article; zbMATH DE number 4101245