On The Strong and the Semi-Strong Path Partition Conjecture

Sriraman Sridharan () and Patrick Vilamajó ()
Additional contact information
Sriraman Sridharan: Université de Perpignan Via Domitia
Patrick Vilamajó: Laboratoire PROMES — CNRS UPR 8521, Rambla de la Thermodynamique, Tecnosud

Indian Journal of Pure and Applied Mathematics, 2020, vol. 51, issue 1, 289-296

Abstract: Abstract We define two families of graphs and prove the strong and the weak path partition conjectures for subfamilies of these graphs.

Keywords: Coloring; strong coloring; stable set; elementary path; 05Cxx: 3; 68R10; 20B25 (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-020-0401-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:51:y:2020:i:1:d:10.1007_s13226-020-0401-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-020-0401-0

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().