Achromatic and harmonious colorings of circulant graphs
From MaRDI portal
Publication:4604012
DOI10.1002/JGT.22137zbMATH Open1380.05058OpenAlexW2590367170WikidataQ62595885 ScholiaQ62595885MaRDI QIDQ4604012FDOQ4604012
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Fragmentability of graphs
- Constructing \(k\)-radius sequences
- Packing analogue of \(k\)-radius sequences
- The existence of \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Achromatic number of fragmentable graphs
- Title not available (Why is that?)
- Achromatic number of collections of paths and cycles
- Detachments of Complete Graphs
- The harmonious chromatic number of complete \(r\)-ary trees
- New upper bounds on harmonious colorings
- The Harmonious Chromatic Number of Bounded Degree Graphs
Cited In (5)
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)