Toughness and \((a,b,k)\)-critical graphs

DOI10.1016/j.ipl.2011.01.012zbMath1260.68310OpenAlexW1523843921MaRDI QIDQ1944908

Jiashang Jiang, Si-zhong Zhou

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.012

zbMATH Keywords

graphcombinatorial problemsminimum degreetoughness\((a,b,k)\)-critical graph\([a,b\)-factor]

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• \((2,k)\)-factor-critical graphs and toughness
• A new degree condition for graphs to have \([a,b\)-factor]
• Toughness of graphs and the existence of factors
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
• Toughness and the existence ofk-factors
• Notes on the binding numbers for (a, b, k)-critical graphs

This page was built for publication: Toughness and \((a,b,k)\)-critical graphs