On toughness and fractional \((g,f,n)\)-critical graphs
type: Item
instance of: scholarly article
title: On toughness and fractional \((g,f,n)\)-critical graphs
zbMATH Open document ID: 1228.05241
author: Shuli Liu
published in: Information Processing Letters
publication date: 2012-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C72
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5998993
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph
zbMATH Keywords: toughness
zbMATH Keywords: fractional \((g,f)\)-factor
zbMATH Keywords: fractional \((g,f,n)\)-critical graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.03.005
OpenAlex ID: W1519432145
cites work: Q3070282
cites work: Q5422499
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q4830487
cites work: Q5492603
cites work: Q3011817
cites work: Toughness and the existence of fractional \(k\)-factors of graphs
cites work: \((a,b,k)\)-critical graphs.
cites work: Fractional \((g,f)\)-factors of graphs
cites work: Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
cites work: Q4382863
cites work: Some results on fractional \(n\)-factor-critical graphs
cites work: On fractional \((f,n)\)-critical graphs
cites work: Notes on the binding numbers for (a, b, k)-critical graphs
DOI: 10.1016/J.IPL.2010.03.005
description: scientific article; zbMATH DE number 5998993