The Cartesian product of a k-extendable and an l-extendable graph is (k+l+1)-extendable

DOI10.1016/0012-365X(92)90593-5MaRDI QIDQ1197017zbMATH OpenOpenAlexFDO

Authors Ervin Győri, Michael D. Plummer

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90593-5

zbMATH Keywords

Cartesian productextendable graph

Mathematics Subject Classification ID

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

Review text

The authors prove that the Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable.

Cites work

• scientific article; zbMATH DE number 434908 (Why is no real title available?)
• Matching theory
• On n-extendable graphs
• On Representatives of Subsets

Cited in

(15)

• Extending matchings in graphs: A survey
• Matchings and matching extensions in graphs
• On linkedness in the Cartesian product of graphs
• High girth and extendability
• On Cartesian product of factor-critical graphs
• The antistrong property for special digraph families
• Extendability and criticality in matching theory
• On the matching extendability of graphs in surfaces
• Strong product of factor-critical graphs
• On the restricted matching extension of graphs on the torus and the Klein bottle
• On matching extendability of lexicographic products
• Matching extendability in Cartesian products of cycles
• Matching extension in prism graphs
• Surface Embedding of Non-Bipartite $k$-Extendable Graphs
• Uniquely restricted matching extendable graphs

This page was built for publication: The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable

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