The distinguishing chromatic number of bipartite graphs of girth at least six

zbMath1463.05150arXiv1709.10021MaRDI QIDQ5122711

Saeid Alikhani, Samaneh Soltani

Publication date: 23 September 2020

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

zbMATH Keywords

symmetry breakingdistinguishing numberdistinguishing chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: The distinguishing chromatic number of bipartite graphs of girth at least six