Disjoint blocking sets in cycle systems
type: Item
instance of: scholarly article
title: Disjoint blocking sets in cycle systems
zbMATH Open document ID: 0930.05008
DOI: 10.1016/S0012-365X(99)00099-0
author: Salvatore Milici
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 2000-01-30T00:00:00Z
review text: An \(m\)-cycle system of order \(n\) is a collection of cycles of length \(m\) which partition the edge set of the complete graph \(K_n\). Given an \(m\)-cycle system, a blocking set is a set of vertices that intersects all cycles and does not contain any cycle. A partition of the vertex set into \(k\) sets such that every set intersects all cycles is called a strong \(k\)-coloring. (A blocking set is a strong 2-coloring.) The authors use constructive and nonconstructive methods to prove various existence results for strongly \(k\)-colorable \(m\)-cycle systems.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 51E21
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1369800
zbMATH Keywords: blocking set
zbMATH Keywords: coloring problem
zbMATH Keywords: cycle system
reviewed by: Patric R. J. Östergård
MaRDI profile type: Publication
Wikidata QID: Q127359255
full work available at URL: s0012-365x(99)00099-0
OpenAlex ID: W2003917332
description: scientific article; zbMATH DE number 1369800