Conditions for graphs to be path partition optimal

DOI10.1016/J.DISC.2018.02.011MaRDI QIDQ1709536zbMATH OpenOpenAlexWikidataFDO

Authors Binlong Li, Hajo Broersma, Shenggui Zhang

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) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the path partition of graphs
• Path optimization for graph partitioning problems
• scientific article; zbMATH DE number 3889553
• The path partition problem and related problems in bipartite graphs
• Path partitionable graphs
• On the path partition dimension of a graph
• On partitions of graphs under degree constraints
• Graph partitions with minimum degree constraints
• Path partitions of planar graphs
• Partitioning a graph into vertex-disjoint paths

Cites work

• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• scientific article; zbMATH DE number 3465355 (Why is no real title available?)
• A note on Hamiltonian circuits
• A remark on two sufficient conditions for Hamilton cycles
• Augmentation Problems
• Characterizing forbidden pairs for hamiltonian properties
• Degree conditions on induced claws
• Graph theory
• Heavy subgraph pairs for traceability of block-chains
• Note on Hamilton Circuits
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

Cited in

(3)

• Path optimization for graph partitioning problems
• Path partitions of almost regular graphs
• The formula for Turán number of spanning linear forests

This page was built for publication: Conditions for graphs to be path partition optimal

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