An isolated toughness condition for graphs to be fractional (a, b, k)-critical graphs

zbMATH Open1293.05311MaRDI QIDQ2870960FDOQ2870960

Authors: Quanru Pan, Sizhong Zhou 

Publication date: 21 January 2014

Published in: Utilitas Mathematica (Search for Journal in Brave)

Recommendations

• Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs
• New toughness conditions for the fractional critical graphs
• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• On all fractional \({(a,b,k)}\)-critical graphs

zbMATH Keywords

minimum degreeisolated toughnessfractional \([a,b\)-factor]fractional \((a,b,k)\)-critical graph

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (11)

• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Conditions of a graph being fractional \(k\)-factor-critical
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Binding numbers for all fractional \((a,b,k)\)-critical graphs
• On all fractional \({(a,b,k)}\)-critical graphs
• Title not available (Why is that?)
• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• Some results on fractional \(k\)-factor-critical graphs and fractional \(k\)-extendable graphs
• Parameters and fractional factors in different settings
• A neighborhood condition for all fractional \((a,b,k)\)-critical graphs.
• New toughness conditions for the fractional critical graphs

This page was built for publication: An isolated toughness condition for graphs to be fractional \((a, b, k)\)-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870960)