On Cartesian product of factor-critical graphs

DOI10.1007/s00373-011-1072-8zbMath1256.05207OpenAlexW1966205566MaRDI QIDQ1926021

Xu Yang, Qinglin Yu, ZeFang Wu

Publication date: 27 December 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-011-1072-8

zbMATH Keywords

matchingprojectionCartesian product of graphsfactor-criticality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• On k-factor-critical graphs
• On the strong product of a \(k\)-extendable and an \(l\)-extendable graph