Minimum path cover in quasi-claw-free graphs

DOI10.1007/S41980-019-00294-4zbMATH Open1457.05084OpenAlexW2980914077MaRDI QIDQ779733FDOQ779733

Xiaodong Chen, Mingda Liu, Huiqing Liu

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

Recommendations

• Path factor in a quasi-claw-free graph
• Degree sum conditions for traceable quasi-claw-free graphs
• Path cover in \({K_{1,4}}\)-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Closure, path-factors and path coverings in claw-free graphs

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

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

Cited In (2)

• Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
• Path factor in a quasi-claw-free graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779733)