3-paths in graphs with bounded average degree (Q274685): Difference between revisions

@@ Property / DOI @@
-.7151/dmgt.1859
@@ Property / DOI: 10.7151/dmgt.1859 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.7151/dmgt.1859
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.1859 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2319747975
@@ Property / OpenAlex ID: W2319747975 / rank @@
+Normal rank
@@ Property / cites work @@
+Light edges in degree-constrained graphs
@@ Property / cites work: Light edges in degree-constrained graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Describing 3-paths in normal plane maps
@@ Property / cites work: Describing 3-paths in normal plane maps / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum average degree and the oriented chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+A structural property of convex 3-polytopes
@@ Property / cites work: A structural property of convex 3-polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Describing short paths in plane graphs of girth at least 5
+Normal rank
@@ Property / cites work @@
+Note on 3-paths in plane graphs of girth 4
@@ Property / cites work: Note on 3-paths in plane graphs of girth 4 / rank @@
+Normal rank
@@ Property / DOI @@
+.7151/DMGT.1859
@@ Property / DOI: 10.7151/DMGT.1859 / rank @@
+Normal rank