Sun toughness and path-factor uniform graphs
From MaRDI portal
Publication:6186566
DOI10.1051/ro/2022201OpenAlexW4308944264MaRDI QIDQ6186566
Publication date: 2 February 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2022201
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Component factors with large components in graphs
- 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
- Packing paths of length at least two
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- 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
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform 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
- On k-orthogonal factorizations in networks
- A Note of Generalization of Fractional ID-factor-critical Graphs
- Isolated toughness for path factors in networks
- The existence of path-factor uniform graphs with large connectivity
- The binding number of a graph and its Anderson number
- 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: Sun toughness and path-factor uniform graphs
