Plane triangulations without large 2-trees

DOI10.26493/1855-3974.3066.5BFMaRDI QIDQ6897931zbMATH OpenFDO

Authors Allan Bickle, Gunnar Brinkmann

Publication date 19 November 2025

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.3066.5BF

zbMATH Keywords

2-treeHamiltonian cycletriangulationYutsis partition

Mathematics Subject Classification ID

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

Cites work

• Counting cycles in planar triangulations
• Hamilton cycles in plane triangulations
• House of Graphs: a database of interesting graphs
• scientific article; zbMATH DE number 4103086 (Why is no real title available?)
• scientific article; zbMATH DE number 3180958 (Why is no real title available?)
• scientific article; zbMATH DE number 3480616 (Why is no real title available?)
• Long cycles in 3-connected graphs
• On acyclic simplicial complexes
• On spanning 2-trees in a graph
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Plane Triangulations Without Spanning 2-Trees
• Simple paths on polyhedra
• Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks

This page was built for publication: Plane triangulations without large 2-trees

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