Uniquely restricted matching extendable graphs

DOI10.1007/S00373-024-02795-4MaRDI QIDQ6544522zbMATH OpenFDO

Authors Caibing Chang, Yan Liu

Publication date 27 May 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-024-02795-4

zbMATH Keywords

extendableperfect matchinguniquely restricted matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• Uniquely restricted matchings in subcubic graphs without short cycles
• On the complexity of minimum maximal uniquely restricted matching
• Graphs in which some and every maximum matching is uniquely restricted
• On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
• On the complexity of minimum maximal uniquely restricted matching

Cites work

• Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
• Extending matchings in graphs: A survey
• scientific article; zbMATH DE number 1286491 (Why is no real title available?)
• scientific article; zbMATH DE number 2230936 (Why is no real title available?)
• Induced matchings
• On n-extendable graphs
• Ranks of zero patterns and sign patterns^*
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• Toughness and matching extension in graphs
• Uniquely restricted matchings

This page was built for publication: Uniquely restricted matching extendable graphs

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