Minimum path cover in quasi-claw-free graphs

DOI10.1007/S41980-019-00294-4zbMath1457.05084OpenAlexW2980914077MaRDI QIDQ779733

Mingda Liu, Huiqing Liu, Xiao Dong Chen

Publication date: 14 July 2020

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-019-00294-4

zbMATH Keywords

path cover numberquasi-claw-free graphminimum path covernon-insertable vertex

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Arc coverings of graphs
• Variations on the Gallai-Milgram theorem
• Quasi-claw-free graphs
• On domination in connected cubic graphs
• Note on Hamilton Circuits
• Hamilton cycles in claw-free graphs
• Covering 2‐connected 3‐regular graphs with disjoint paths
• Hamiltonicity for K_{1, r}‐free graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Minimum path cover in quasi-claw-free graphs