A note on complex-4-colorability of signed planar graphs
DOI10.37236/9844zbMATH Open1464.05154OpenAlexW3157544201MaRDI QIDQ831346FDOQ831346
Authors: Arnfried Kemnitz, Margit Voigt 
Publication date: 11 May 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9844
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- \(4\)-colouring of generalized signed planar graphs
- On the 4-color theorem for signed graphs
- Complex and homomorphic chromatic number of signed planar simple graphs
- Vertex signatures and edge-4-colorings of 4-regular plane graphs
- Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs
- A characterization of signed planar graphs with rank at most 4
- Colouring of generalized signed triangle-free planar graphs
- A note on not-4-list colorable planar graphs
- A note on total colorings of planar graphs without 4-cycles
- A sufficient condition for planar graphs to be DP-4-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)
Cites Work
Cited In (6)
- Complex and homomorphic chromatic number of signed planar simple graphs
- \(4\)-colouring of generalized signed planar graphs
- Colouring of \(S\)-labelled planar graphs
- On the 4-color theorem for signed graphs
- Density of \(C_{-4}\)-critical signed graphs
- Vertex signatures and edge-4-colorings of 4-regular plane graphs
This page was built for publication: A note on complex-4-colorability of signed planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831346)
