scientific article; zbMATH DE number 1439475

zbMath0961.05057MaRDI QIDQ4949854

Qinglin Yu, Gui Zhen Liu

Publication date: 20 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

characterizationextendable graphstoughness\(k\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (8)

A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs ⋮ A new degree condition for graphs to have \([a,b\)-factor] ⋮ Toughness in graphs -- a survey ⋮ 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 ⋮ Toughness and the existence of \(k\)-factors. III

This page was built for publication: