Colouring even cycle systems
From MaRDI portal
The authors consider the problem of assigning cycle systems to vertex colorings in which no cycle is monochromatic.
Cites work
- 5‐chromatic steiner triple systems
- Caps and colouring Steiner triple systems
- Coloring 4-cycle systems
- Coloring Steiner Triple 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
- scientific article; zbMATH DE number 3815655 (Why is no real title available?)
- scientific article; zbMATH DE number 124520 (Why is no real title available?)
- scientific article; zbMATH DE number 1228814 (Why is no real title available?)
- scientific article; zbMATH DE number 1290170 (Why is no real title available?)
- scientific article; zbMATH DE number 2147950 (Why is no real title available?)
- scientific article; zbMATH DE number 3218576 (Why is no real title available?)
- scientific article; zbMATH DE number 2192115 (Why is no real title available?)
- scientific article; zbMATH DE number 3238443 (Why is no real title available?)
- scientific article; zbMATH DE number 3338396 (Why is no real title available?)
- scientific article; zbMATH DE number 3344591 (Why is no real title available?)
- On colourings of Steiner triple systems
- On Hamilton circuits and Hamilton paths
- On the chromatic number of Steiner triple systems of order 25
Cited in
(7)
This page was built for publication: Colouring even cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470468)