Edge-decompositions of highly connected graphs into paths
From MaRDI portal
(Redirected from Publication:1032504)
Recommendations
Cites work
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- A Reduction Method for Edge-Connectivity in Graphs
- Claw‐decompositions and tutte‐orientations
- Edge-Disjoint Spanning Trees of Finite Graphs
- Every graph of sufficiently large average degree contains a C₄-free subgraph of large average degree
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Girth in graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Graph Theory and Probability
- Graph theory with applications
- Graphs on surfaces
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Minimum partition of a matroid into independent subsets
- On the Problem of Decomposing a Graph into n Connected Factors
Cited in
(26)- Decomposing graphs into paths and trees
- Hamilton path decompositions of complete multipartite graphs
- Minimal path decomposition of complete bipartite graphs
- Decomposing highly connected graphs into paths of length five
- Decomposing graphs into long paths
- A proof of the Barát-Thomassen conjecture
- Edge decompositions of hypercubes by paths and by cycles
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Cycles through all finite vertex sets in infinite graphs
- Decomposing graphs into paths of fixed length
- Edge-partitioning 3-edge-connected graphs into paths
- Decompositions of highly connected graphs into paths of any given length
- Decompositions of highly connected graphs into paths of length five
- The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
- Decomposing highly edge-connected graphs into paths of any given length
- Decompositions of highly connected graphs into paths of length 3
- Graph factors modulo k
- Edge-decomposition of graphs into copies of a tree with four edges
- The weak 3-flow conjecture and the weak circular flow conjecture
- Decomposing a graph into bistars
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
- Star decomposition of graphs
- Edge‐decomposing graphs into coprime forests
- Modulo factors with bounded degrees
- What is on his mind?
This page was built for publication: Edge-decompositions of highly connected graphs into paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1032504)
