Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

DOI10.2478/AUSM-2019-0026zbMATH Open1436.05092OpenAlexW3010446527MaRDI QIDQ2178486FDOQ2178486

Shariefuddin Pirzada, Mushtaq A. 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

Recommendations

• Combinatorial Geometry and Graph Theory
• Construction of maximally non-Hamiltonian graphs
• An explicit construction of graphs of bounded degree that are far from being Hamiltonian
• A large set of non-Hamiltonian graphs
• On Finding Hamiltonian Cycles in Barnette Graphs
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
• scientific article; zbMATH DE number 1866902
• scientific article
• On the construction and enumeration of Hamiltonian graphs
• A note on maximal nonhamiltonian Burkard-Hammer graphs

zbMATH Keywords

cubic graphplanar graphHamiltonian graphBarnette graph

Mathematics Subject Classification ID

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

Cites Work

• Hamiltonian circuits in polytopes with even sided faces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs
• On hypercube labellings and antipodal monochromatic paths
• Polytopes, graphs, and complexes
• A note on Barnette's conjecture

Cited In (2)

• Combinatorial Geometry and Graph Theory
• Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes

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

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