On strong regal and strong royal colorings

DOI10.61091/jcmcc121-09zbMATH Open1546.05065MaRDI QIDQ6586637

Ping Zhang, James Hallas

Publication date: 13 August 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

edge coloringinduced vertex coloringregal and royal coloringroyal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Vizing-like theorem for union vertex-distinguishing edge coloring
• General neighbour-distinguishing index of a graph
• Extremal Problems in Royal Colorings of Graphs
• Royal colorings of graphs.

This page was built for publication: On strong regal and strong royal colorings

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