Proper distinguishing colorings with few colors for graphs with girth at least 5

zbMath1393.05109arXiv1707.05439MaRDI QIDQ1658779

Daniel W. Cranston

Publication date: 15 August 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

automorphismgreedy coloringdistinguishing chromatic numberdistinguishing coloringgirth 5

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Equitable distinguishing chromatic number ⋮ The distinguishing number and distinguishing chromatic number for posets

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The distinguishing chromatic number
• On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• Graphs with large distinguishing chromatic number
• Distinguishing chromatic numbers of bipartite graphs
• Bounds on the distinguishing chromatic number
• On-line list colouring of graphs
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• Transitive Graphs With Fewer Than Twenty Vertices

This page was built for publication: Proper distinguishing colorings with few colors for graphs with girth at least 5