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

DOI10.1016/0012-365X(92)90593-5zbMATH Open0769.05075OpenAlexW2086569783MaRDI QIDQ1197017FDOQ1197017

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)

Cites Work

• Matching theory
• On Representatives of Subsets
• On n-extendable graphs
• Title not available (Why is that?)

Cited In (15)

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