Regular factors in vertex-deleted subgraphs of regular graphs
type: Item
instance of: scholarly article
title: Regular factors in vertex-deleted subgraphs of regular graphs
zbMATH Open document ID: 0808.05079
DOI: 10.1016/0012-365X(94)90398-0
author: P. Katerinis
published in: Discrete Mathematics
publication date: 1995-03-07T00:00:00Z
review text: It is proved that for any \(2r\)-regular, \(2r\)-edge-connected graph \(G\) of odd order and any of its vertices \(u\), the graph \(G-u\) has an \(m\)-factor whenever \(1 \leq m \leq r\). This was previously known only for \(m=1\), see \textit{C. H. C. Little, D. D. Grant}, and \textit{D. A. Holton} [On defect-\(d\) matchings in graphs, Discrete Math. 13, 41-54 (1975; Zbl 0304.05120)].
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 626331
zbMATH Keywords: regular graph
zbMATH Keywords: regular factor
zbMATH Keywords: vertex-deleted subgraph
MaRDI profile type: Publication
cites work: Q5422499
cites work: On defect-d matchings in graphs
cites work: The Factors of Graphs
description: scientific article; zbMATH DE number 626331