On strong regal and strong royal colorings
type: Item
instance of: scholarly article
title: On strong regal and strong royal colorings
zbMATH Open document ID: 1546.05065
DOI: 10.61091/jcmcc121-09
author: James Hallas
author: Ping Zhang
published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
publication date: 2024-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7896118
zbMATH Keywords: edge coloring
zbMATH Keywords: induced vertex coloring
zbMATH Keywords: regal and royal coloring
zbMATH Keywords: royal chromatic number
MaRDI profile type: Publication
cites work: A Vizing-like theorem for union vertex-distinguishing edge coloring
cites work: Royal colorings of graphs.
cites work: Q5855395
cites work: Extremal Problems in Royal Colorings of Graphs
cites work: General neighbour-distinguishing index of a graph
cites work: Q4590882
description: scientific article; zbMATH DE number 7896118