Toughness and \((a,b,k)\)-critical graphs
type: Item
instance of: scholarly article
title: Toughness and \((a,b,k)\)-critical graphs
zbMATH Open document ID: 1260.68310
author: Jiashang Jiang
author: Sizhong Zhou
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6149194
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph
zbMATH Keywords: minimum degree
zbMATH Keywords: toughness
zbMATH Keywords: \([a,b]\)-factor
zbMATH Keywords: \((a,b,k)\)-critical graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.012
OpenAlex ID: W1523843921
cites work: Q5422499
cites work: \((2,k)\)-factor-critical graphs and toughness
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and the existence ofk-factors
cites work: Toughness of graphs and the existence of factors
cites work: A new degree condition for graphs to have \([a,b]\)-factor
cites work: \((a,b,k)\)-critical graphs.
cites work: Toughness and the existence of fractional \(k\)-factors of graphs
cites work: Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
cites work: A sufficient condition for a graph to be an (a, b, k)-critical graph
cites work: BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs
cites work: Q3581672
cites work: Q3367974
cites work: Notes on the binding numbers for (a, b, k)-critical graphs
cites work: NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
DOI: 10.1016/J.IPL.2011.01.012
description: scientific article; zbMATH DE number 6149194