A note on Barnette's conjecture

DOI10.1016/J.DISC.2011.08.011zbMATH Open1238.05095OpenAlexW1982697922WikidataQ123278280 ScholiaQ123278280MaRDI QIDQ409412FDOQ409412

Authors: Xiaoyun Lu 

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.011

Recommendations

• Thoughts on Barnette's conjecture
• Minimal reducible bounds for planar graphs
• On Barnette's conjecture
• Necessary condition for cubic planar 3-connected graph to be non-Hamiltonian with proof of Barnette's conjecture
• A note on Barnette's conjecture

zbMATH Keywords

plane triangulationsBarnette conjecturecompatible graphsextendable graphsnon-extendable graphsreducibletree-coloring

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Hamiltonian circuits in polytopes with even sided faces
• Vertex and tree arboricities of graphs
• B-sets and planar maps
• On Barnette's conjecture

Cited In (6)

• Distance-two colourings of Barnette graphs
• A note on Breda-Robertson's conjecture
• Minimal reducible bounds for planar graphs
• A note on the Bateman-Horn conjecture
• Thoughts on Barnette's conjecture
• A note on Barnette's conjecture

This page was built for publication: A note on Barnette's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409412)