Extendability and factor-criticality

DOI10.1016/S0012-365X(99)00172-7zbMath0943.05066MaRDI QIDQ1970705

Odile Favaron

Publication date: 28 August 2000

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

zbMATH Keywords

independence numberperfect matchingfactor-critical graphextendable graph

Mathematics Subject Classification ID

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

Related Items

Generalization of matching extensions in graphs. II. ⋮ On the \(p\)-factor-criticality of the Klein bottle ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ On the restricted matching extension of graphs on the torus and the Klein bottle ⋮ 3-factor-criticality in domination critical graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ 3-Factor-Criticality of Vertex-Transitive Graphs ⋮ The characterization of \(p\)-factor-critical graphs