Independence number in \(n\)-extendable graphs
type: Item
instance of: scholarly article
title: Independence number in \(n\)-extendable graphs
zbMATH Open document ID: 0854.05086
DOI: 10.1016/0012-365X(95)00042-U
author: Peter Maschlanka
author: Lutz Volkmann
published in: Discrete Mathematics
publication date: 1997-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 906899
zbMATH Keywords: connected graph
zbMATH Keywords: perfect matching
zbMATH Keywords: \(n\)-extendable graph
zbMATH Keywords: independence number
zbMATH Keywords: saturation number
MaRDI profile type: Publication
cites work: A note on Hamiltonian circuits
cites work: Q3035329
cites work: Q3340896
cites work: Matching theory
cites work: On n-extendable graphs
cites work: Q3800093
cites work: Q5202207
cites work: Extending matchings in graphs: A survey
full work available at URL: 0012-365x(95)00042-u
OpenAlex ID: W2022904408
Wikidata QID: Q127858071
description: scientific article; zbMATH DE number 906899