Path-factor critical covered graphs and path-factor uniform graphs

DOI10.1051/ro/2022208MaRDI QIDQ6186581

No author found.

Publication date: 2 February 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

zbMATH Keywords

independence numberminimum degree\(P_{\geq 3}\)-factor uniform graph\(P_{\geq 3}\)-factor\((P_{\geq 3}, n)\)-factor critical covered graph

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) Vertex degrees (05C07)

Related Items (2)

Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs

Cites Work

• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• Packing 3-vertex paths in claw-free graphs and related topics
• Minimum degree, independence number and pseudo \([2, b\)-factors in graphs]
• Component factors with large components in graphs
• On path factors of \((3,4)\)-biregular bigraphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered 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
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Research on fractional critical covered graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• Path and cycle factors of cubic bipartite graphs
• Path factors of bipartite graphs
• Sufficient conditions for the existence of a path‐factor which are related to odd components
• On k-orthogonal factorizations in networks
• Some degree conditions for 𝒫_≥k-factor covered graphs
• 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 existence of path-factor uniform graphs with large connectivity
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Path factors and neighborhoods of independent sets in graphs
• Isolated toughness and path-factor uniform graphs. II.

This page was built for publication: Path-factor critical covered graphs and path-factor uniform graphs