Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644): Difference between revisions

@@ Property / cites work @@
+Q4876966
@@ Property / cites work: Q4876966 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial cases of graph decomposition: A complete solution of Holyer's problem
+Normal rank
@@ Property / cites work @@
+\(\vec{P_3}\)-decomposition of directed graphs
@@ Property / cites work: \(\vec{P_3}\)-decomposition of directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Some Properties of Graphs with Multiple Edges
@@ Property / cites work: Some Properties of Graphs with Multiple Edges / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Deterministic Maximum Flow Algorithm
@@ Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of multigraphs
@@ Property / cites work: Decomposition of multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank