Symmetric set coloring of signed graphs

DOI10.1007/s00026-022-00593-4zbMath1518.05057arXiv2106.05928MaRDI QIDQ6114964

Chiara Cappello, Eckhard Steffen

Publication date: 12 July 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

independent setsnon-bipartite antibalanced subgraphssymset-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Degree choosable signed graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• How colorful the signed graph?
• The chromatic number of a signed graph
• Signed graph coloring
• Three short proofs in graph theory
• Circular chromatic number of signed graphs
• Concepts of signed graph coloring
• On DP-coloring of graphs and multigraphs
• The chromatic spectrum of signed graphs
• On the notion of balance of a signed graph
• Circular coloring of signed graphs
• Coloring permutation-gain graphs

This page was built for publication: Symmetric set coloring of signed graphs