Equitably 2-colourable even cycle systems
From MaRDI portal
Recommendations
Cites work
- Coloring 4-cycle systems
- Coloring Steiner Triple Systems
- Colouring even cycle systems
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions with a sharply vertex transitive automorphism group
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Equitably colored balanced incomplete block designs
- Extreme equitable block colorings of \(C_4\)-decompositions of \(K_v-F\)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- On 2-pyramidal Hamiltonian cycle systems
- On balanced incomplete block designs with specified weak chromatic number
- On cycle systems with specified weak chromatic number
- On the existence of unparalleled even cycle systems
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Some equitably 2-colourable cycle decompositions of multipartite graphs
- Some equitably 2-colourable cycle decompositions.
- Some equitably 3-colourable cycle decompositions
- Some equitably 3-colourable cycle decompositions of complete equipartite graphs
- Unbalanced Steiner triple systems
Cited in
(3)
This page was built for publication: Equitably 2-colourable even cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990136)
