Packing 1-plane Hamiltonian cycles in complete geometric graphs
Counting the number of Hamiltonian cycles that are contained in a geometric graph is #P-complete even if the graph is known to be planar [15]. A relaxation for problems in plane geometric graphs is to allow the geometric graphs to be 1-plane, that is, each of its edges is crossed at most once. We co...
Saved in:
Main Authors: | Trao, Hazim Michman, Ali, Niran Abbas, Chia, Gek L., Kilicman, Adem |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Sciences and Mathematics, University of Nis
2019
|
Online Access: | http://psasir.upm.edu.my/id/eprint/81605/1/PLANE.pdf http://psasir.upm.edu.my/id/eprint/81605/ http://journal.pmf.ni.ac.rs/filomat/index.php/filomat/article/view/6771 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On some packing and partition problems in geometric graphs
by: Trao, Hazim Michman
Published: (2018) -
Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021) -
Restricted triangulation on circulant graphs
by: Ali, Niran Abbas, et al.
Published: (2018) -
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
by: Maizon, Mohd Darus
Published: (2015) -
Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
by: Aldiabat, Raja’i, et al.
Published: (2019)