Conditions for graphs to be path partition optimal

Binlong Li, Hajo Broersma (Corresponding Author), Shenggui Zhang

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Citation (Scopus)

    Abstract

    The path partition number of a graph is the minimum number of edges we have to add to turn it into a Hamiltonian graph, and the separable degree is the minimum number of edges we have to add to turn it into a 2-connected graph. A graph is called path partition optimal if its path partition number is equal to its separable degree. We study conditions that guarantee path partition optimality. We extend several known results on Hamiltonicity to path partition optimality, in particular results involving degree conditions and induced subgraph conditions.
    Original languageEnglish
    Pages (from-to)1350-1358
    Number of pages9
    JournalDiscrete mathematics
    Volume341
    Issue number5
    DOIs
    Publication statusPublished - 1 May 2018

    Fingerprint Dive into the research topics of 'Conditions for graphs to be path partition optimal'. Together they form a unique fingerprint.

    Cite this