Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782): Difference between revisions

@@ Property / author @@
-Gek Ling Chia
@@ Property / author: Gek Ling Chia / rank @@
-Normal rank
@@ Property / author @@
+Gek Ling Chia
@@ Property / author: Gek Ling Chia / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint compatibility graph of non-crossing matchings of points in convex position
+Normal rank
@@ Property / cites work @@
+Compatible geometric matchings
@@ Property / cites work: Compatible geometric matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Packing plane spanning trees and paths in complete geometric graphs
+Normal rank
@@ Property / cites work @@
+Q3855221
@@ Property / cites work: Q3855221 / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3455035
@@ Property / cites work: Q3455035 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of complete geometric graphs into plane trees
+Normal rank
@@ Property / cites work @@
+On Hamiltonian alternating cycles and paths
@@ Property / cites work: On Hamiltonian alternating cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / cites work @@
+Q3113726
@@ Property / cites work: Q3113726 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on 1-planarity
@@ Property / cites work: An annotated bibliography on 1-planarity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
+Normal rank
@@ Property / cites work @@
+Algorithms for ham-sandwich cuts
@@ Property / cites work: Algorithms for ham-sandwich cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
+Normal rank
@@ Property / cites work @@
+Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
+Normal rank
@@ Property / cites work @@
+On the Number of Crossing‐Free Matchings, Cycles, and Partitions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2298/fil1906561t
+Normal rank
@@ Property / OpenAlex ID @@
+W3003174638
@@ Property / OpenAlex ID: W3003174638 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5080782