On the chromatic numbers of signed triangular and hexagonal grids

DOI10.1016/J.IPL.2021.106156zbMath1478.05054arXiv2012.09678OpenAlexW3169919287MaRDI QIDQ2234782

Fabien Jacques

Publication date: 19 October 2021

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemshomomorphismschromatic numbersigned graphs

Mathematics Subject Classification ID

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

Related Items (2)

The chromatic number of signed graphs with bounded maximum average degree ⋮ On the pushable chromatic number of various types of grids

Cites Work

• Unnamed Item
• Edge-switching homomorphisms of edge-coloured graphs
• Signed graphs
• 2-edge-colored chromatic number of grids is at most 9
• Pushable chromatic number of graphs with degree constraints
• Homomorphisms of signed graphs: an update
• Signed coloring of 2-dimensional grids
• Homomorphisms of Signed Graphs
• Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
• Homomorphisms of 2-edge-colored graphs

This page was built for publication: On the chromatic numbers of signed triangular and hexagonal grids