On the strong and the semi-strong path partition conjecture

DOI10.1007/s13226-020-0401-0zbMath1437.05080OpenAlexW3010805174WikidataQ123302003 ScholiaQ123302003MaRDI QIDQ1985941

Sriraman Sridharan, Patrick Vilamajó

Publication date: 7 April 2020

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-020-0401-0

zbMATH Keywords

stable setcoloringelementary pathstrong coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the strong path partition conjecture of Berge
• Mangoes and blueberries
• k-optimal partitions of a directed graph
• Covering digraphs by paths
• Berge's conjecture on directed path partitions -- a survey
• Proof of Berge's strong path partition conjecture for \(k=2\)
• A decomposition theorem for partially ordered sets
• Nombre chromatique et plus longs chemins d'un graphe
• The structure of Sperner k-families

This page was built for publication: On the strong and the semi-strong path partition conjecture