A note on Halton's conjecture (Q707336): Difference between revisions

@@ Property / Wikidata QID @@
+Q122894089
@@ Property / Wikidata QID: Q122894089 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2003.06.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1968235777
@@ Property / OpenAlex ID: W1968235777 / rank @@
+Normal rank
@@ Property / cites work @@
+Multilayer grid embeddings for VLSI
@@ Property / cites work: Multilayer grid embeddings for VLSI / rank @@
+Normal rank
@@ Property / cites work @@
+Biplanar graphs: A survey
@@ Property / cites work: Biplanar graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the thickness of graphs of given degree
@@ Property / cites work: On the thickness of graphs of given degree / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the thickness of graphs is NP-hard
@@ Property / cites work: Determining the thickness of graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+The thickness of graphs: A survey
@@ Property / cites work: The thickness of graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Graphs with Given Girth and Restricted Circuits
+Normal rank
@@ Property / cites work @@
+Q3726142
@@ Property / cites work: Q3726142 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856672
@@ Property / cites work: Q3856672 / rank @@
+Normal rank