Uniquely restricted matching extendable graphs

DOI10.1007/s00373-024-02795-4zbMATH Open1540.05142MaRDI QIDQ6544522

Yan Liu, Caibing Chang

Publication date: 27 May 2024

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

zbMATH Keywords

perfect matchinguniquely restricted matchingextendable

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On n-extendable graphs
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• Induced matchings
• Extending matchings in graphs: A survey
• Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges
• Toughness and matching extension in graphs
• Ranks of zero patterns and sign patterns^*
• 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)