Achromatic and Harmonious Colorings of Circulant Graphs

DOI10.1002/jgt.22137zbMath1380.05058OpenAlexW2590367170WikidataQ62595885 ScholiaQ62595885MaRDI QIDQ4604012

Paweł Rzążewski, Zbigniew Lonc, Michał Dębski

Publication date: 23 February 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22137

zbMATH Keywords

achromatic numberharmonious chromatic numbercirculant graph\(k\)-radius sequence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Achromatic numbers for circulant graphs and digraphs ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Packing analogue of \(k\)-radius sequences
• Achromatic number of collections of paths and cycles
• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• The harmonious chromatic number of complete \(r\)-ary trees
• Fragmentability of graphs
• Constructing 𝑘-radius sequences
• Achromatic number of fragmentable graphs
• New upper bounds on harmonious colorings
• Detachments of Complete Graphs
• The Harmonious Chromatic Number of Bounded Degree Graphs

This page was built for publication: Achromatic and Harmonious Colorings of Circulant Graphs