Edge-decompositions of highly connected graphs into paths

DOI10.1007/s12188-008-0002-zzbMath1181.05057OpenAlexW2041502697WikidataQ56926628 ScholiaQ56926628MaRDI QIDQ1032504

Carsten Thomassen

Publication date: 26 October 2009

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12188-008-0002-z

zbMATH Keywords

edge-decompositionhigh edge-connectivitypath-decompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs, 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, Cycles through all finite vertex sets in infinite graphs, Edge‐decomposing graphs into coprime forests, Graph factors modulo \(k\), Edge-decomposition of graphs into copies of a tree with four edges, Decomposing graphs into paths and trees, The weak 3-flow conjecture and the weak circular flow conjecture, Hamilton path decompositions of complete multipartite graphs, Decomposing a graph into bistars, Decomposing graphs into paths of fixed length, Minimal path decomposition of complete bipartite graphs, A proof of the Barát-Thomassen conjecture, Decomposing highly connected graphs into paths of length five, What is on his mind?, Decompositions of highly connected graphs into paths of length 3, Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm, Star decomposition of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Girth in graphs
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Graph Theory and Probability
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Claw‐decompositions and tutte‐orientations
• Minimum partition of a matroid into independent subsets