Complex and homomorphic chromatic number of signed planar simple graphs
DOI10.1007/S00373-021-02433-3zbMATH Open1498.05103OpenAlexW3103437050WikidataQ123142740 ScholiaQ123142740MaRDI QIDQ2117521FDOQ2117521
Authors: 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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)
Cites Work
- Signed graph coloring
- On acyclic colorings of planar graphs
- Note on a paper of B. Grünbaum on acyclic colorings
- The chromatic number of a signed graph
- Homomorphisms of edge-colored graphs and Coxeter groups
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- Homomorphisms of signed graphs
- Homomorphisms of signed graphs: an update
- A note on not-4-list colorable planar graphs
- \(4\)-colouring of generalized signed planar graphs
- On the 4-color theorem for signed graphs
- A note on complex-4-colorability of signed planar graphs
- Circular chromatic number of signed graphs
- A refinement of choosability of graphs
- Concepts of signed graph coloring
Cited In (7)
- Signed planar graphs with given circular chromatic numbers
- A note on complex-4-colorability of signed planar graphs
- On the 4-color theorem for signed graphs
- Packing Signatures in Signed Graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Homomorphisms of signed graphs
- Walk-powers and homomorphism bounds of planar signed graphs
This page was built for publication: Complex and homomorphic chromatic number of signed planar simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117521)
