Nonhamiltonian triangulations with large connectivity and representativity

DOI10.1006/jctb.1996.0056zbMath0872.05009OpenAlexW2061524875MaRDI QIDQ1924157

Nora Hartsfield, Dan S. Archdeacon, Charles H. C. Little

Publication date: 25 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0056

zbMATH Keywords

triangulationconnectivityrepresentativityhamiltonian

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Unnamed Item, Every 5-connected planar triangulation is 4-ordered Hamiltonian, 2-connected spanning subgraphs with low maximum degree in locally planar graphs, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Spanning trees: A survey, The 2-extendability of 5-connected graphs on surfaces with large representativity, What is on his mind?, 2- and 3-factors of graphs on surfaces, Long cycles in graphs on a fixed surface, Unnamed Item