Non-Hamiltonian bicubic graphs (Q1120592)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4101245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-Hamiltonian bicubic graphs |
scientific article; zbMATH DE number 4101245 |
Statements
Non-Hamiltonian bicubic graphs (English)
0 references
1989
0 references
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.
0 references
bipartite
0 references
3-regular
0 references
bicubic graph
0 references
0.8411223292350769
0 references
0.8398920893669128
0 references
0.8359607458114624
0 references
0.8330864906311035
0 references
