Path factors in subgraphs

DOI10.1016/j.dam.2021.04.012zbMath1494.05102MaRDI QIDQ2161249

Quanru Pan, Qiuxiang Bian, Si-zhong Zhou

Publication date: 4 August 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.012

zbMATH Keywords

binding number; \( ( P_{\geq 2}, n )\)-critical deleted graph; \( ( P_{\geq 3}, n )\)-critical deleted graph; \(P_{\geq 2}\)-faktor; \(P_{\geq 3}\)-faktor

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

Related Items

A Note of Generalization of Fractional ID-factor-critical Graphs, An existence theorem on fractional ID-(g, f)-factor-critical covered graphs, TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS, Path factors and neighborhoods of independent sets in graphs, Binding number and path-factor critical deleted graphs, Isolated toughness and path-factor uniform graphs. II., Degree conditions for the existence of a {P₂, P₅}-factor in a graph, Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius, Sun toughness and path-factor uniform graphs, Path-factor critical covered graphs and path-factor uniform graphs, The \(A_\alpha\)-spectral radius for path-factors in graphs, A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs, On \(P_{\geq 3}\)-factor deleted graphs, Discussion on fractional \((a, b, k)\)-critical covered graphs, Discussions on orthogonal factorizations in digraphs, On path-factor critical deleted (or covered) graphs, A result on fractional \((a,b,k)\)-critical covered graphs, Nash-Williams conditions for the existence of all fractional \([a,b\)-factors], Two sufficient conditions for odd \([1,b\)-factors in graphs], Some sufficient conditions for path-factor uniform graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Binding numbers and connected factors
• Packing 3-vertex paths in claw-free graphs and related topics
• Component factors with large components in graphs
• Path factors and parallel knock-out schemes of almost claw-free graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Binding numbers and \(f\)-factors of graphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Binding number conditions for matching extension
• A generalization of orthogonal factorizations in digraphs
• The existence of a path-factor without small odd paths
• Packing paths of length at least two
• Some results on path-factor critical avoidable graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Subgraphs with orthogonal factorizations in graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• \([a,b\)-factors of graphs on surfaces]
• Remarks on path factors in graphs
• Path and cycle factors of cubic bipartite graphs
• Path factors in cubic graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Isolated toughness and path-factor uniform graphs
• On k-orthogonal factorizations in networks
• The binding number of a graph and its Anderson number
• Partitioning vertices of 1-tough graphs into paths
• Path factors in claw-free graphs