Vertex partitions by connected monochromatic \(k\)-regular graphs
type: Item
instance of: scholarly article
title: Vertex partitions by connected monochromatic \(k\)-regular graphs
zbMATH Open document ID: 1028.05093
author: Gábor N. Sárközy
author: Stanley Selkow
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1464292
zbMATH Keywords: coloring
MaRDI profile type: Publication
full work available at URL: jctb.1999.1933
OpenAlex ID: W2075905937
cites work: Vertex coverings by monochromatic cycles and trees
cites work: Q3977492
cites work: Partitioning complete bipartite graphs by monochromatic cycles
cites work: Q4878666
cites work: Blow-up lemma
cites work: Q3880849
cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
cites work: Dense graphs without 3-regular subgraphs
DOI: 10.1006/JCTB.1999.1933
description: scientific article; zbMATH DE number 1464292