Minimal reducible bounds for planar graphs (Q1970573)
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 1420210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal reducible bounds for planar graphs |
scientific article; zbMATH DE number 1420210 |
Statements
Minimal reducible bounds for planar graphs (English)
0 references
21 March 2000
0 references
The well-known Barnette conjecture says: If \(G\) is a 3-connected bipartite 3-valent planar graph, then \(G\) has a Hamilton cycle. This conjecture is true iff the vertices of each 3-colourable planar graph are partitionable into two subsets each inducing a forest. Among other results, the authors investigate some classes of planar graphs with this property.
0 references
vertex partition
0 references
minimal reducible bound
0 references
Barnette conjecture
0 references
planar graph
0 references
Hamilton cycle
0 references
0.8691783547401428
0 references
0.8681096434593201
0 references
0.8662050366401672
0 references
0.8585619926452637
0 references
0.8552258610725403
0 references
