Strong product of factor-critical graphs

DOI10.1080/00207160.2011.564276zbMath1241.05119OpenAlexW2083617335MaRDI QIDQ2885500

Qinglin Yu, ZeFang Wu, Xu Yang

Publication date: 23 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.564276

zbMATH Keywords

perfect matchingstrong productproduct graph\(T\)-joinfactor-criticality

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• Fast and Simple Algorithms for Weighted Perfect Matching
• Matching, Euler tours and the Chinese postman
• Paths, Trees, and Flowers
• On the strong product of a \(k\)-extendable and an \(l\)-extendable graph

This page was built for publication: Strong product of factor-critical graphs