On partitioning the edges of graphs into connected subgraphs

From MaRDI portal
Publication:3816108

DOI10.1002/jgt.3190090416zbMath0665.05040OpenAlexW2168495785MaRDI QIDQ3816108

Michael Jünger, William R. Pulleyblank, Gerhard Reinelt

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190090416



Related Items

Graphs and digraphs with given girth and connectivity, An overview of graph covering and partitioning, Decomposing series-parallel graphs into paths of length 3 and triangles, Claw-free graphs---a survey, Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree, Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases, Edge-decomposition of graphs into copies of a tree with four edges, Efficient algorithms for a mixed k-partition problem of graphs without specifying bases, Decomposing graphs into paths of fixed length, Packing \([1, \Delta \)-factors in graphs of small degree], Arc-routing for winter road maintenance, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian, Path factors and parallel knock-out schemes of almost claw-free graphs, A pair of forbidden subgraphs and perfect matchings., What is on his mind?, Deficiency and forbidden subgraphs of connected, locally-connected graphs, The Ryjáček closure and a forbidden subgraph, Decompositions of highly connected graphs into paths of length 3, Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm, Unnamed Item, A note on edge-decompositions of planar graphs, On the complexity of partitioning graphs into connected subgraphs, Star decomposition of graphs, Chain packing in graphs, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets