Disjoint blocking sets in cycle systems (Q1808812): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127359255, #quickstatements; #temporary_batch_1722284575798 |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)00099-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2003917332 / rank | |||
Normal rank |
Latest revision as of 09:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Disjoint blocking sets in cycle systems |
scientific article |
Statements
Disjoint blocking sets in cycle systems (English)
0 references
30 January 2000
0 references
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.
0 references
blocking set
0 references
coloring problem
0 references
cycle system
0 references