Covering the edges of a connected graph by paths
From MaRDI portal
Publication:1907117
DOI10.1006/jctb.1996.0012zbMath0840.05071OpenAlexW2056587530MaRDI QIDQ1907117
Publication date: 27 June 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0012
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (23)
On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ An overview of graph covering and partitioning ⋮ On path decompositions of \(2k\)-regular graphs ⋮ Path decomposition of graphs with given path length ⋮ On path decompositions of \(2 k\)-regular graphs ⋮ Gallai's conjecture for graphs with treewidth 3 ⋮ Gallai's conjecture on path decompositions ⋮ Towards Gallai's path decomposition conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ On Gallai's conjecture for graphs with maximum degree 6 ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Gallai's path decomposition conjecture for graphs of small maximum degree ⋮ Gallai's path decomposition conjecture for triangle-free planar graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Gallai's Conjecture For Graphs of Girth at Least Four ⋮ Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings ⋮ Path decompositions and Gallai's conjecture ⋮ Unnamed Item ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem ⋮ Path and cycle decompositions of dense graphs ⋮ Subgraph coverings and edge switchings ⋮ Cycle packing
This page was built for publication: Covering the edges of a connected graph by paths
