On cycle systems with specified weak chromatic number
From MaRDI portal
Publication:1957974
DOI10.1016/j.jcta.2009.11.008zbMath1206.05057OpenAlexW2054188207MaRDI QIDQ1957974
Publication date: 27 September 2010
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2009.11.008
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Unnamed Item ⋮ Colourings of star systems ⋮ On balanced incomplete block designs with specified weak chromatic number ⋮ Six-cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Disjoint blocking sets in cycle systems
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- A partial \(2k\)-cycle system of order \(n\) can be embedded in a \(2k\)-cycle system of order \(kn+c(k),k\geqslant 3\), where \(c(k)\) is a quadratic function of \(k\)
- Colouring even cycle systems
- On the chromatic number of set systems
- Cycle decompositions III: Complete graphs and fixed length cycles
- Coloring 4-cycle systems
- On the construction of odd cycle systems
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- Coloring Steiner Triple Systems
This page was built for publication: On cycle systems with specified weak chromatic number
