Gallai's Conjecture For Graphs of Girth at Least Four

DOI10.1002/jgt.21735zbMath1292.05154OpenAlexW1866996682WikidataQ123336338 ScholiaQ123336338MaRDI QIDQ5417821

Peter Harding, Sean McGuinness

Publication date: 22 May 2014

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

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

zbMATH Keywords

girthpath-decomposition

Mathematics Subject Classification ID

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

Related Items (7)

On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ On path decompositions of \(2k\)-regular graphs ⋮ Walks, partitions, and normal ordering ⋮ Hamilton path decompositions of complete multipartite graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Path and cycle decompositions of dense graphs

Cites Work

• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• Gallai's conjecture for disconnected graphs
• An upper bound for the path number of a graph
• Path decompositions of multigraphs

This page was built for publication: Gallai's Conjecture For Graphs of Girth at Least Four