Minimal graphs for matching extensions
type: Item
instance of: scholarly article
title: Minimal graphs for matching extensions
zbMATH Open document ID: 1376.05118
published in: Discrete Applied Mathematics
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6820603
zbMATH Keywords: maximum matching
zbMATH Keywords: matching extension
zbMATH Keywords: expandable graph
zbMATH Keywords: completable graph
author: Marie-Christine Costa
author: Dominique De Werra
author: Christophe Picouleau
MaRDI profile type: Publication
full work available at URL: j.dam.2015.11.007
OpenAlex ID: W2183353618
cites work: On matching extensions with prescribed and proscribed edge sets. II
cites work: Generalization of matching extensions in graphs. III
cites work: Q5615282
cites work: Q5422499
cites work: The extendability of matchings in strongly regular graphs
cites work: Q4198056
cites work: Generalization of matching extensions in graphs. II.
cites work: Generalization of matching extensions in graphs
cites work: Matching theory
cites work: Toughness and matching extension in graphs
cites work: Extending matchings in graphs: A survey
DOI: 10.1016/J.DAM.2015.11.007
description: scientific article; zbMATH DE number 6820603