A pair of forbidden subgraphs and perfect matchings.
type: Item
instance of: scholarly article
title: A pair of forbidden subgraphs and perfect matchings.
zbMATH Open document ID: 1090.05057
author: Shinya Fujita
author: Ken-ichi Kawarabayashi
author: Katsuhiro Ota
author: Michael D. Plummer
author: Akira Saito
author: Cláudio L. Lucchesi
published in: Journal of Combinatorial Theory. Series B
publication date: 2006-05-18T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5024275
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jctb.2005.08.002
OpenAlex ID: W1988932361
cites work: Q3258698
cites work: Q4350166
cites work: Characterizing forbidden pairs for hamiltonian properties
cites work: Q3838229
cites work: On partitioning the edges of graphs into connected subgraphs
cites work: Q4074931
cites work: Matching theory
cites work: Forbidden subgraphs and bounds on the size of a maximum matching
cites work: 1-Factors and Antifactor Sets
DOI: 10.1016/J.JCTB.2005.08.002
Recommended article: A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Recommended article: Forbidden induced subgraphs for perfect matchings
Recommended article: A pair of forbidden subgraphs and 2-factors
Recommended article: Forbidden induced subgraphs for near perfect matchings
Recommended article: Forbidden pairs with a common graph generating almost the same sets
Recommended article: Pairs and triples of forbidden subgraphs and the existence of a 2‐factor
Recommended article: Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian
Recommended article: Q4393306
Recommended article: Forbidden subgraphs and bounds on the size of a maximum matching
Recommended article: Forbidden pairs and the existence of a dominating cycle
description: scientific article; zbMATH DE number 5024275