Strong product of factor-critical graphs
type: Item
instance of: scholarly article
title: Strong product of factor-critical graphs
zbMATH Open document ID: 1241.05119
DOI: 10.1080/00207160.2011.564276
author: Zefang Wu
author: Xu Yang
author: Qinglin Roger Yu
published in: International Journal of Computer Mathematics
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 6037868
zbMATH Keywords: factor-criticality
zbMATH Keywords: product graph
zbMATH Keywords: strong product
zbMATH Keywords: perfect matching
zbMATH Keywords: \(T\)-join
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/00207160.2011.564276
OpenAlex ID: W2083617335
cites work: Paths, Trees, and Flowers
cites work: Matching, Euler tours and the Chinese postman
cites work: On the strong product of a \(k\)-extendable and an \(l\)-extendable graph
cites work: The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
cites work: Fast and Simple Algorithms for Weighted Perfect Matching
Recommended article: Strong products of \(\chi\)-critical graphs
Recommended article: On Cartesian product of factor-critical graphs
Recommended article: Strongly perfect products of graphs
Recommended article: Q5403617
Recommended article: Q4865480
Recommended article: Strong products of Kneser graphs
Recommended article: Pancyclicity of strong products of graphs
Recommended article: Connectivity of strong products of graphs
Recommended article: Grundy numbers of strong products of graphs
Recommended article: Q4906801
description: scientific article; zbMATH DE number 6037868