Gallai's conjecture for disconnected graphs
From MaRDI portal
Publication:1970699
DOI10.1016/S0012-365X(99)00167-3zbMath0943.05067WikidataQ122887990 ScholiaQ122887990MaRDI QIDQ1970699
Mekkia Kouider, Nathaniel Dean
Publication date: 28 August 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (12)
On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ Gallai's conjecture on path decompositions ⋮ 1‐independent percolation on ℤ2×Kn ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Gallai's Conjecture For Graphs of Girth at Least Four ⋮ Path decompositions and Gallai's conjecture ⋮ Path and cycle decompositions of dense graphs ⋮ Cycle packing ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five
This page was built for publication: Gallai's conjecture for disconnected graphs
