A degree condition for fractional \([a,b]\)-covered graphs
From MaRDI portal
Publication:1711417
DOI10.1016/j.ipl.2018.11.002zbMath1481.05131OpenAlexW2900236623MaRDI QIDQ1711417
Publication date: 18 January 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.11.002
fractional \([a,b\)-covered graph]
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (11)
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Cites Work
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- A generalization of orthogonal factorizations in digraphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle]
- A result on \(r\)-orthogonal factorizations in digraphs
- A degree condition for a graph to have \((a,b)\)-parity factors
- On all fractional \({(a,b,k)}\)-critical graphs
- Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
- Remarks on orthogonal factorizations of digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A degree condition for fractional \([a,b]\)-covered graphs
