Minimal reducible bounds for planar graphs (Q1970573)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minimal reducible bounds for planar graphs
scientific article

    Statements

    Minimal reducible bounds for planar graphs (English)
    0 references
    0 references
    0 references
    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

    Identifiers