On the strong product of a \(k\)-extendable and an \(l\)-extendable graph

DOI10.1007/PL00007244zbMath0978.05061OpenAlexW2072854970MaRDI QIDQ5943044

Ervin Gyoeri, Wilfried Imrich

Publication date: 9 September 2001

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

Full work available at URL: https://doi.org/10.1007/pl00007244

zbMATH Keywords

Cartesian product\(k\)-extendable graphperfect matchingstrong product

Mathematics Subject Classification ID

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

Related Items (3)

Strong product of factor-critical graphs ⋮ On Cartesian product of factor-critical graphs ⋮ On matching extendability of lexicographic products

This page was built for publication: On the strong product of a \(k\)-extendable and an \(l\)-extendable graph