Conditions for graphs to be path partition optimal

DOI10.1016/j.disc.2018.02.011zbMath1383.05187OpenAlexW2793133492MaRDI QIDQ1709536

Sheng Gui Zhang, Hajo J. Broersma, Bin Long Li

Publication date: 5 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.011

zbMATH Keywords

forbidden subgraphseparable degreepath partition numberheavy subgraphheft indexpath partition optimal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

The formula for Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree conditions on induced claws
• A remark on two sufficient conditions for Hamilton cycles
• Characterizing forbidden pairs for hamiltonian properties
• Heavy subgraph pairs for traceability of block-chains
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Augmentation Problems
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs