On the 4-color theorem for signed graphs

DOI10.1016/j.ejc.2020.103215zbMath1458.05073arXiv1906.05638OpenAlexW3082346901MaRDI QIDQ2225420

František Kardoš, Jonathan Narboni

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numbersigned graph

Mathematics Subject Classification ID

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

Related Items (11)

Generalized signed graphs of large girth and large chromatic number ⋮ Signed planar graphs with given circular chromatic numbers ⋮ Separating signatures in signed planar graphs ⋮ On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 ⋮ Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs ⋮ Homomorphisms to small negative even cycles ⋮ Homomorphisms of signed graphs: an update ⋮ A refinement of choosability of graphs ⋮ Circular chromatic number of signed graphs ⋮ Density of \(C_{-4}\)-critical signed graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs

Cites Work

• The chromatic number of a signed graph
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Signed graphs
• Signed graph coloring
• The four-colour theorem
• Coloring face-hypergraphs of graphs on surfaces
• A refinement of choosability of graphs
• On the notion of balance of a signed graph

This page was built for publication: On the 4-color theorem for signed graphs