Gallai's path decomposition conjecture for triangle-free planar graphs

DOI10.1016/j.disc.2019.01.020zbMath1407.05062arXiv1803.06768OpenAlexW2964312866WikidataQ122890110 ScholiaQ122890110MaRDI QIDQ1732776

Maycon Sambinelli, Andrea Jiménez, Fábio Botler

Publication date: 25 March 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.06768

zbMATH Keywords

decompositionpathtriangle-freeGallai's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ Gallai's conjecture on path decompositions ⋮ Towards Gallai's path decomposition conjecture ⋮ On Gallai's conjecture for graphs with maximum degree 6

Cites Work

• Gallai's path decomposition conjecture for graphs of small maximum degree
• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• On path decompositions of \(2 k\)-regular graphs
• Beautiful conjectures in graph theory
• On path-cycle decompositions of triangle-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gallai's path decomposition conjecture for triangle-free planar graphs