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

DOI10.1016/0012-365X(92)90593-5zbMath0769.05075OpenAlexW2086569783MaRDI QIDQ1197017

Ervin Gyoeri, 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)

Related Items (14)

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

Cites Work

• Matching theory
• On n-extendable graphs
• On Representatives of Subsets
• Unnamed Item

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