Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs

DOI10.7151/dmgt.2075zbMath1401.05228OpenAlexW2802019301MaRDI QIDQ1630936

Yuan Yuan, Rong-xia Hao

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2075

zbMATH Keywords

independence numberconnectivityfractional \([a, b\)-factor]all fractional \((a, b, k)\)-critical graphfractional \((a, b, k)\)-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (12)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Component factors and binding number conditions in graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Parameters and fractional factors in different settings ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• A characterization of graphs having all \((g,f)\)-factors
• Simplified existence theorems for \((g,f)\)-factors
• A result on \(r\)-orthogonal factorizations in digraphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• Simplified existence theorems on all fractional \([a,b\)-factors]
• On all fractional \({(a,b,k)}\)-critical graphs
• Binding numbers for all fractional (a, b, k)-critical graphs
• Independence number, connectivity, and r‐factors
• Some results about component factors in graphs
• Independence number, connectivity and fractional (g,f)-factors in graphs
• Some remarks about factors of graphs
• Fractional \((g,f)\)-factors of graphs

This page was built for publication: Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs