Factor criticality and complete closure of graphs

DOI10.1016/S0012-365X(02)00564-2zbMath1017.05087OpenAlexW1997150286MaRDI QIDQ1874349

Akira Saito, Nawarat Ananchuen

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00564-2

zbMATH Keywords

independence numberperfect matchingdomination numberclosure\(n\)-factor-critical graphslocal completion

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Some results on fractional \(n\)-factor-critical graphs

This page was built for publication: Factor criticality and complete closure of graphs