Decompositions of highly connected graphs into paths of length 3 (Q3630834): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.20311
@@ Property / DOI: 10.1002/jgt.20311 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20311
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20311 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4242000175
@@ Property / OpenAlex ID: W4242000175 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56926624
@@ Property / Wikidata QID: Q56926624 / rank @@
+Normal rank
@@ Property / cites work @@
+Claw‐decompositions and tutte‐orientations
@@ Property / cites work: Claw‐decompositions and tutte‐orientations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3360905
@@ Property / cites work: Q3360905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+On partitioning the edges of graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Girth in graphs
@@ Property / cites work: Girth in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-decompositions of highly connected graphs into paths
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / DOI @@
+.1002/JGT.20311
@@ Property / DOI: 10.1002/JGT.20311 / rank @@
+Normal rank