Some results about component factors in graphs
From MaRDI portal
Publication:5242258
DOI10.1051/ro/2017045zbMath1426.05142OpenAlexW2619803636MaRDI QIDQ5242258
Publication date: 6 November 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2017045
Deterministic network models in operations research (90B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (21)
A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ On path-factor critical deleted (or covered) graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Remarks on component factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ The extension degree conditions for fractional factor ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Parameters and fractional factors in different settings ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Cites Work
- Unnamed Item
- Star-factors with large components
- On factors with given components
- Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor]
- Graph factors and factorization: 1985--2003: a survey
- Path-factors in the square of a tree
- Component factors with large components in 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 numbers for fractional ID-\(k\)-factor-critical graphs
- Remarks on orthogonal factorizations of digraphs
- Binding numbers for all fractional (a, b, k)-critical graphs
- Graph Factors and Matching Extensions
- Factors and factorizations of graphs—a survey
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Some new sufficient conditions for graphs to have fractionalk-factors
- The binding number of a graph and its Anderson number
- Partitioning vertices of 1-tough graphs into paths
This page was built for publication: Some results about component factors in graphs
