Gallai's Conjecture For Graphs of Girth at Least Four (Q5417821): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.21735
@@ Property / DOI: 10.1002/jgt.21735 / rank @@
-Normal rank
@@ Property / cites work @@
+Path decompositions of multigraphs
@@ Property / cites work: Path decompositions of multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Gallai's conjecture for disconnected graphs
@@ Property / cites work: Gallai's conjecture for disconnected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the path number of a graph
@@ Property / cites work: An upper bound for the path number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Path decompositions and Gallai's conjecture
@@ Property / cites work: Path decompositions and Gallai's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the edges of a connected graph by paths
@@ Property / cites work: Covering the edges of a connected graph by paths / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.21735
@@ Property / DOI: 10.1002/JGT.21735 / rank @@
+Normal rank