Degree conditions for fractional \((a,b,k)\)-critical covered graphs

DOI10.1016/j.ipl.2019.105838zbMath1481.05132OpenAlexW2964824910WikidataQ127394298 ScholiaQ127394298MaRDI QIDQ2328309

Yang Xu, Zhi-ren Sun, Si-zhong Zhou

Publication date: 10 October 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105838

zbMATH Keywords

fractional \([a,b\)-covered graph]fractional \([a,b\)-factor]combinatorial problems: degree conditionfractional \((a,b,k)\)-critical covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (21)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Component factors and binding number conditions in graphs ⋮ A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Path factors in subgraphs ⋮ 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 ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Randomly \(r\)-orthogonal factorizations in bipartite 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 ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ Some results on path-factor critical avoidable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Generalizations of marriage theorem for degree factors
• Graph factors and factorization: 1985--2003: a survey
• A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• A degree condition for fractional \([a,b\)-covered graphs]
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Maximum fractional factors in graphs
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
• Remarks on orthogonal factorizations of digraphs
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Degree sum condition for fractional ID-$k$-factor-critical graphs
• Some new sufficient conditions for graphs to have fractionalk-factors
• \((1,f)\)-factors of graphs with odd property

This page was built for publication: Degree conditions for fractional \((a,b,k)\)-critical covered graphs