Packing 1-plane Hamiltonian cycles in complete geometric graphs
From MaRDI portal
Publication:5080782
DOI10.2298/FIL1906561TzbMath1499.05524OpenAlexW3003174638MaRDI QIDQ5080782
Hazim Michman Trao, Adem Kilicman, Niran Abbas Ali, Gek Ling Chia
Publication date: 31 May 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1906561t
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compatible geometric matchings
- The book thickness of a graph
- Algorithms for ham-sandwich cuts
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- On Hamiltonian alternating cycles and paths
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- An annotated bibliography on 1-planarity
- Partitions of complete geometric graphs into plane trees
- Packing plane spanning trees and paths in complete geometric graphs
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
This page was built for publication: Packing 1-plane Hamiltonian cycles in complete geometric graphs
