1. Home

A note on Barnette's conjecture

Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c |V(G) | vertices.

Preview

Category

Published in:
Discussiones mathematicae : Graph theory
Vol. 33, 2013, No. 1 (13.04.2013), p. 133-137
Volume:
33, 2013
No.:
1
Date Created:
30.01.2020
Date Issued:
13.04.2013
DOI:
10.7151/dmgt.1643
PPN:
827720106
Language:
English
Type of Resource:
Text
Extent:
6 Seiten
Keywords:
  1. planar graph
    Typ
    Schlagwort
  2. Hamilton cycle
    Typ
    Schlagwort
  3. Barnette's Conjecture
    Typ
    Schlagwort
DDC subject of DNB:
510 Mathematics
Hosting institution:
Technische Universität Ilmenau, Fakultät für Mathematik und Naturwissenschaften

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction: