Distinguishing graphs by total colourings

DOI10.26493/1855-3974.751.9A8zbMath1351.05081OpenAlexW1867215589MaRDI QIDQ2835392

Rafał Kalinowski, Monika Pilśniak, Mariusz Woźniak

Publication date: 2 December 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.751.9a8

zbMATH Keywords

symmetry breaking in graphstotal colourings of graphstotal distinguishing chromatic numbertotal distinguishing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Bounds for distinguishing invariants of infinite graphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ A note on breaking small automorphisms in graphs ⋮ Distinguishing threshold of graphs ⋮ Number of distinguishing colorings and partitions ⋮ Proper distinguishing arc-colourings of symmetric digraphs ⋮ Distinguishing number and distinguishing index of certain graphs

This page was built for publication: Distinguishing graphs by total colourings