Factor-criticality and matching extension in DCT-graphs

DOI10.7151/DMGT.1054zbMath0907.05040OpenAlexW2076369586MaRDI QIDQ4210670

Zdeněk Ryjáček, Evelyne Flandrin, Odile Favaron

Publication date: 11 February 1999

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1054

zbMATH Keywords

claw-free graphmatching extensionfactor-criticality

Mathematics Subject Classification ID

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

Related Items (5)

A characterization of maximal non-\(k\)-factor-critical graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ The characterization of \(p\)-factor-critical graphs

This page was built for publication: Factor-criticality and matching extension in DCT-graphs