Toughness and the existence of \(k\)-factors. IV

DOI10.1016/S0012-365X(99)00298-8zbMath0952.05057OpenAlexW2153983222WikidataQ127846139 ScholiaQ127846139MaRDI QIDQ1567269

Hikeo Enomoto, Mariko Hagita

Publication date: 14 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00298-8

zbMATH Keywords

factor-critical graphstoughnessregular factor

Mathematics Subject Classification ID

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

Related Items (6)

Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Toughness in graphs -- a survey ⋮ A sufficient condition for a graph to be an (a, b, k)-critical graph ⋮ Induced claws and existence of even factors of graphs ⋮ Toughness and the existence of \(k\)-factors. III ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

This page was built for publication: Toughness and the existence of \(k\)-factors. IV