Some results about ID-path-factor critical graphs

DOI10.47443/dml.2023.131OpenAlexW4388638058MaRDI QIDQ6063851

Zhi-ren Sun, Si-zhong Zhou

Publication date: 12 December 2023

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

Full work available at URL: https://doi.org/10.47443/dml.2023.131

zbMATH Keywords

independent setbinding number\(P_{\geq k}\)-factorID-\(P_{\geq k}\)-factor critical graph

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
• Star-factors with large components
• Packing 3-vertex paths in claw-free graphs and related topics
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Binding numbers and \(f\)-factors of graphs
• An extension of Tutte's 1-factor theorem
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Packing paths of length at least two
• The extension degree conditions for fractional factor
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• On path-factor critical deleted (or covered) graphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Research on fractional critical covered graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Some sufficient conditions for path-factor uniform graphs
• On packing 3-vertex paths in a graph
• On k-orthogonal factorizations in networks
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Independence number and connectivity for fractional (a, b, k)-critical covered graphs
• Isolated toughness for path factors in networks
• The binding number of a graph and its Anderson number
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Characterizing an odd [1, b-factor on the distance signless Laplacian spectral radius]

This page was built for publication: Some results about ID-path-factor critical graphs