Complex and homomorphic chromatic number of signed planar simple graphs

DOI10.1007/s00373-021-02433-3zbMath1498.05103OpenAlexW3103437050WikidataQ123142740 ScholiaQ123142740MaRDI QIDQ2117521

Reza Naserasr, Lan Anh Pham

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02433-3

zbMATH Keywords

planar graphscoloringsigned graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (1)

Packing Signatures in Signed Graphs

Cites Work

• A note on complex-4-colorability of signed planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• On acyclic colorings of planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• A note on not-4-list colorable planar graphs
• Circular chromatic number of signed graphs
• \(4\)-colouring of generalized signed planar graphs
• On the 4-color theorem for signed graphs
• Homomorphisms of signed graphs: an update
• Concepts of signed graph coloring
• A refinement of choosability of graphs
• Note on a paper of B. Grünbaum on acyclic colorings
• Homomorphisms of Signed Graphs
• Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs

This page was built for publication: Complex and homomorphic chromatic number of signed planar simple graphs