Generalising the achromatic number to Zaslavsky's colourings of signed graphs

DOI10.1016/j.tcs.2022.05.009OpenAlexW3202544877MaRDI QIDQ2672623

François Dross, Nacim Oijid, Julien Bensmail, Eric Sopena

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberachromatic numbersigned graphcomplete colouringZaslavsky's colouring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic number of a signed graph
• Concerning the achromatic number of graphs
• Some perfect coloring properties of graphs
• Signed graphs
• Signed graph coloring
• Graph with given achromatic number
• On the achromatic number of signed graphs
• Achromatic number is NP-complete for cographs and interval graphs
• Homomorphisms of signed graphs: an update
• Concepts of signed graph coloring
• Further results on the achromatic number
• The achromatic number of a graph

This page was built for publication: Generalising the achromatic number to Zaslavsky's colourings of signed graphs