On cycle systems with specified weak chromatic number
From MaRDI portal
Recommendations
Cites work
- 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\)
- A partial m=(2k+1)-cycle system of order n can be embedded in an m- cycle of order (2n+1)m
- Coloring 4-cycle systems
- Coloring Steiner Triple Systems
- Colouring even cycle systems
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Disjoint blocking sets in cycle systems
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- scientific article; zbMATH DE number 4081593 (Why is no real title available?)
- scientific article; zbMATH DE number 3675916 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 398960 (Why is no real title available?)
- scientific article; zbMATH DE number 1228814 (Why is no real title available?)
- scientific article; zbMATH DE number 3338396 (Why is no real title available?)
- On the chromatic number of set systems
- On the construction of odd cycle systems
Cited in
(8)
This page was built for publication: On cycle systems with specified weak chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1957974)