On n-extendable graphs
type: Item
instance of: scholarly article
title: On n-extendable graphs
zbMATH Open document ID: 0442.05060
DOI: 10.1016/0012-365X(80)90037-0
author: Michael D. Plummer
published in: Discrete Mathematics
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 3689447
zbMATH Keywords: order
zbMATH Keywords: minimum degree
zbMATH Keywords: extendability
zbMATH Keywords: connectivity results
zbMATH Keywords: extendable graphs
MaRDI profile type: Publication
cites work: Some Theorems on Abstract Graphs
cites work: Q3273706
cites work: On Representatives of Subsets
cites work: Parallel concepts in graph theory
cites work: A theorem on connected graphs in which every edge belongs to a 1-factor
cites work: On the structure of factorizable graphs
cites work: Q4083483
cites work: Q4065587
cites work: On minimal elementary bipartite graphs
cites work: On a Family of Planar Bicritical Graphs
cites work: The Factorization of Linear Graphs
description: scientific article; zbMATH DE number 3689447