An existence theorem on fractional ID-(g, f)-factor-critical covered graphs
DOI10.1080/09728600.2021.2010026zbMath1487.05208OpenAlexW4200459602MaRDI QIDQ5074882
Publication date: 10 May 2022
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2021.2010026
minimum degreefractional \((g, f)\)-factorneighborhood of independent setfractional \((g, f)\)-covered graphfractional ID-\((g, f)\)-factor-critical covered graph
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the existence of fractional \(f\)-factors in random graphs
- \(k\) -factors in regular graphs
- A neighbourhood condition for graphs to have \([a,b\)-factors]
- A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- A degree condition for fractional \([a,b\)-covered graphs]
- Sufficient conditions for graphs to have \((g,f)\)-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Path factors in subgraphs
- 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
- A result on fractional \((a,b,k)\)-critical covered graphs
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Remarks on path factors in graphs
- The structure and existence of 2-factors in iterated line graphs
- Path and cycle factors of cubic bipartite graphs
- Isolated toughness and path-factor uniform graphs
- On k-orthogonal factorizations in networks
- Pairs and triples of forbidden subgraphs and the existence of a 2‐factor
This page was built for publication: An existence theorem on fractional ID-(g, f)-factor-critical covered graphs
