Complex and homomorphic chromatic number of signed planar simple graphs
From MaRDI portal
Publication:2117521
Recommendations
Cites work
- A note on complex-4-colorability of signed planar graphs
- A note on not-4-list colorable planar graphs
- A refinement of choosability of graphs
- Circular chromatic number of signed graphs
- Concepts of signed graph coloring
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- Homomorphisms of signed graphs
- Homomorphisms of signed graphs: an update
- Note on a paper of B. Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- On the 4-color theorem for signed graphs
- Signed graph coloring
- The chromatic number of a signed graph
- \(4\)-colouring of generalized signed planar graphs
Cited in
(7)- Homomorphisms of signed graphs
- A note on complex-4-colorability of signed planar graphs
- Signed planar graphs with given circular chromatic numbers
- Packing Signatures in Signed Graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Walk-powers and homomorphism bounds of planar signed graphs
- On the 4-color theorem for 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)