Types of triangle in Hamiltonian triangulations and an application to domination and k-walks

DOI10.26493/1855-3974.1733.8c6zbMath1433.05179WikidataQ127638841 ScholiaQ127638841MaRDI QIDQ5217058

Gunnar Brinkmann, Kenta Ozeki, Nicolas Van Cleemput

Publication date: 21 February 2020

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

Full work available at URL: https://doi.org/10.26493/1855-3974.1733.8c6

zbMATH Keywords

Hamiltonian cycle; domination; 3-walk

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

Plane Triangulations Without Spanning 2-Trees, Dominating maximal outerplane graphs and Hamiltonian plane triangulations

Uses Software

• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating plane triangulations
• Spanning closed walks and TSP in 3-connected planar graphs
• 3-trees with few vertices of degree 3 in circuit graphs
• 4-connected projective planar graphs are Hamiltonian
• 2-walks in circuit graphs
• Polyhedra with few 3-cuts are Hamiltonian
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Dominating sets of maximal outerplanar graphs
• On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
• On the number of hamiltonian cycles in a maximal planar graph
• Hamilton cycles in plane triangulations
• Trees in Polyhedral Graphs