Every signed planar graph without cycles of length from 4 to 8 is 3-colorable

DOI10.1016/j.disc.2017.09.019zbMath1376.05067OpenAlexW2761787226MaRDI QIDQ1686009

Xiangwen Li, Lili Hu

Publication date: 20 December 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.09.019

zbMATH Keywords

signed graphplanar graph3-colorable graph

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 (4)

Planar graphs without intersecting 5-cycles are signed-4-choosable ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ Concepts of signed graph coloring ⋮ Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Choosability in signed planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

This page was built for publication: Every signed planar graph without cycles of length from 4 to 8 is 3-colorable