Achromatic and harmonious colorings of circulant graphs
From MaRDI portal
Publication:4604012
Recommendations
Cites work
- scientific article; zbMATH DE number 994578 (Why is no real title available?)
- scientific article; zbMATH DE number 1088659 (Why is no real title available?)
- Achromatic number of collections of paths and cycles
- Achromatic number of fragmentable graphs
- Constructing \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Detachments of Complete Graphs
- Fragmentability of graphs
- New upper bounds on harmonious colorings
- Packing analogue of k-radius sequences
- The Harmonious Chromatic Number of Bounded Degree Graphs
- The existence of \(k\)-radius sequences
- The harmonious chromatic number of complete \(r\)-ary trees
Cited in
(5)- Harmonious and achromatic colorings of fragmentable hypergraphs
- On the harmonious chromatic number of graphs
- Achromatic numbers for circulant graphs and digraphs
- Short k‐radius sequences, k‐difference sequences and universal cycles
- scientific article; zbMATH DE number 22642 (Why is no real title available?)
This page was built for publication: Achromatic and harmonious colorings of circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604012)