Highly non-concurrent longest cycles in lattice graphs (Q383750): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2012.03.015
@@ Property / DOI: 10.1016/j.disc.2012.03.015 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2012.03.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2006305199
@@ Property / OpenAlex ID: W2006305199 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar lattice graphs with Gallai's property
@@ Property / cites work: Planar lattice graphs with Gallai's property / rank @@
+Normal rank
@@ Property / cites work @@
+Über längste Wege und Kreise in Graphen
@@ Property / cites work: Über längste Wege und Kreise in Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Highly non-concurrent longest paths in lattices
@@ Property / cites work: Highly non-concurrent longest paths in lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Gallai's property for graphs in lattices on the torus and the Möbius strip
+Normal rank
@@ Property / cites work @@
+Q4146745
@@ Property / cites work: Q4146745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4775880
@@ Property / cites work: Q4775880 / rank @@
+Normal rank
@@ Property / cites work @@
+A two-connected planar graph without concurrent longest paths
+Normal rank
@@ Property / cites work @@
+On longest paths and circuits in graphs.
@@ Property / cites work: On longest paths and circuits in graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3159270
@@ Property / cites work: Q3159270 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2012.03.015
@@ Property / DOI: 10.1016/J.DISC.2012.03.015 / rank @@
+Normal rank