\((2,k)\)-factor-critical graphs and toughness

DOI10.1007/s003730050035zbMath0930.05076OpenAlexW2915117831MaRDI QIDQ1299991

Odile Favaron, Hao Li, Mao-cheng Cai

Publication date: 9 February 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050035

zbMATH Keywords

factorizationmatchingstoughnessfactors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (5)

On tight components and anti-tight components ⋮ Toughness and \((a,b,k)\)-critical graphs ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item ⋮ Toughness and the existence of \(k\)-factors. III

This page was built for publication: \((2,k)\)-factor-critical graphs and toughness