A Kaleidoscopic View of Graph Colorings

DOI10.1007/978-3-319-30518-9zbMath1353.05003OpenAlexW2491838944MaRDI QIDQ2798762

Ping Zhang

Publication date: 13 April 2016

Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30518-9

zbMATH Keywords

graceful labelingharmonious labelingsource coloringtarget colouring

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

Irregular colorings of friendship graph families ⋮ Vertex identification in trees ⋮ On the dominated chromatic number of certain graphs ⋮ Irregular colorings of derived graphs of flower graph ⋮ Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs ⋮ On the sigma chromatic number of the join of a finite number of paths and cycles ⋮ On rainbow mean colorings of trees

This page was built for publication: A Kaleidoscopic View of Graph Colorings