Orbits and Hamilton bonds in a family of plane triangulations with vertices of degree three or six
Jan Florek

TL;DR
This paper studies a special family of plane triangulations with vertices of degree three or six, establishing arithmetic relations for their structural parameters, characterizing certain orbits, and proving properties about Hamilton bonds and disjoint paths.
Contribution
It introduces arithmetic equations to compute graph parameters, characterizes one point orbits, and proves new properties of Hamilton bonds and disjoint paths in these triangulations.
Findings
Characterization of one point orbits in the family.
Existence of Hamilton bonds with equitable 2-colorable end-trees for graphs of order 4n+2.
Presence of disjoint induced paths spanning the graph under certain conditions.
Abstract
Let be the family of all 2-connected plane triangulations with vertices of degree three or six. Gr\"{u}nbaum and Motzkin proved (in the dual terms) that every graph is factorable into factors , , (indexed by elements of the cyclic group ) such that every factor consists of two induced paths with the same length , and induced cycles with the same length . For , we define an integer such that the vector determines the graph (if is simple) uniquely up to orientation-preserving isomorphism. We establish arithmetic equations that will allow calculate the vector by the vector , . We present some applications of the equations. The set is called the orbit of . We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Advanced Combinatorial Mathematics
