Extendability and factor-criticality

DOI10.1016/S0012-365X(99)00172-7MaRDI QIDQ1970705zbMATH OpenFDO

Authors Odile Favaron

Publication date 28 August 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect matchingindependence numberfactor-critical graphextendable graph

Mathematics Subject Classification ID

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

Recommendations

• Equivalence between extendability and factor-criticality
• scientific article; zbMATH DE number 166077
• Closure and factor-critical graphs
• Extendability and criticality in matching theory
• The characterization of \(p\)-factor-critical graphs

Cited in

(17)

• Closure and factor-critical graphs
• On the restricted matching extension of graphs on the torus and the Klein bottle
• Generalization of matching extensions in graphs. II.
• A characterization of maximal non-\(k\)-factor-critical graphs
• The characterization of \(p\)-factor-critical graphs
• 4-factor-criticality of vertex-transitive graphs
• Notes on factor-criticality, extendibility and independence number
• Equivalence between extendability and factor-criticality
• Extending matchings in planar odd graphs.
• A note on extendability and factor-criticality
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• \(p\)-factor-criticality of vertex-transitive graphs with large girth.
• Threshold functions for factor-critical graphs
• 3-factor-criticality of vertex-transitive graphs
• 3-factor-criticality in domination critical graphs
• On the p-factor-criticality of the Klein bottle
• On 1-factors and matching extension

This page was built for publication: Extendability and factor-criticality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970705)