Kaleidoscopic colorings of graphs

DOI10.7151/DMGT.1950zbMATH Open1366.05039OpenAlexW2581231993MaRDI QIDQ2364091FDOQ2364091

Authors: Gary Chartrand, Sean English, Ping Zhang 

Publication date: 17 July 2017

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1950

Recommendations

• Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs
• Kaleidoscopic graphs
• Edge-colorings of 4-regular graphs with the minimum number of palettes
• Regular colorings in regular graphs
• Perfect colorings of regular graphs

zbMATH Keywords

edge coloringvertex coloringkaleidoscopekaleidoscopic coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cites Work

• Vertex-distinguishing proper edge-colorings
• Chromatic graph theory
• Title not available (Why is that?)
• Strong edge colorings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Kaleidoscopic graphs
• Title not available (Why is that?)
• Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs

This page was built for publication: Kaleidoscopic colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364091)