Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

DOI10.2478/ausm-2019-0026zbMath1436.05092OpenAlexW3010446527MaRDI QIDQ2178486

Shariefuddin Pirzada, Mushtaq Ahmad Shah

Publication date: 11 May 2020

Published in: Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausm-2019-0026

zbMATH Keywords

Hamiltonian graphcubic graphplanar graphBarnette graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• Hamiltonian circuits in polytopes with even sided faces
• On hypercube labellings and antipodal monochromatic paths
• A note on Barnette's Conjecture
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes
• A theorem on paths in planar graphs

This page was built for publication: Construction of Barnette graphs whose large subgraphs are non-Hamiltonian