Tight toughness condition for fractional (g,f,n)-critical graphs
From MaRDI portal
Publication:2870474
DOI10.4134/JKMS.2014.51.1.055zbMATH Open1285.05147MaRDI QIDQ2870474FDOQ2870474
Authors: Wei Gao, Li Liang, Tianwei Xu, Juxiang Zhou 
Publication date: 21 January 2014
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: http://www.mathnet.or.kr/mathnet/kms_content.php?no=411353
Recommendations
- On toughness and fractional \((g,f,n)\)-critical graphs
- Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
- New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
- New toughness conditions for the fractional critical graphs
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
- scientific article; zbMATH DE number 6390837
- An isolated toughness condition for graphs to be fractional \((a, b, k)\)-critical graphs
- Toughness and degree condition for fractional ID-\(k\)-factor-critical graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Toughness for fractional \((2, b, k)\)-critical covered graphs
Cited In (23)
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
- Toughness and existence of fractional \((g,f)\)-factors in graphs
- Conditions of a graph being fractional \(k\)-factor-critical
- An independent set degree condition for fractional critical deleted graphs
- Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Toughness and fractional critical deleted graph
- A sufficient condition for a graph to be fractional \((a,b,n)\)-critical deleted graph.
- Title not available (Why is that?)
- New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
- A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs
- A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
- A sufficient condition for a graph to be fractional \((k,n)\)-critical
- A result on \((g,f,n)\)-critical graphs
- On toughness and fractional \((g,f,n)\)-critical graphs
- Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
- New toughness conditions for the fractional critical graphs
- On fractional \((g,f,n)\)-critical graphs.
- Minimum degree conditions for graphs to be \((g,f,n)\)-critical graphs
- An isolated toughness condition for graphs to be fractional \((a, b, k)\)-critical graphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: Tight toughness condition for fractional \((g,f,n)\)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870474)
