Introduction to dominated edge chromatic number of a graph

DOI10.7494/OpMath.2021.41.2.245zbMath1469.05136arXiv2003.10232MaRDI QIDQ5004071

Saeid Alikhani, Mohammad Piri

Publication date: 30 July 2021

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.10232

zbMATH Keywords

coronasubdivisionoperationdominated edge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for equitable coloring
• Trees with distinguishing number two
• Total dominator chromatic number of some operations on a graph
• Dominated colorings of graphs
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• On dominated coloring of graphs and some Nordhaus–Gaddum-type relations
• Acyclic colorings of planar graphs
• Circular chromatic number: A survey

This page was built for publication: Introduction to dominated edge chromatic number of a graph