Planar graphs without intersecting 5-cycles are signed-4-choosable

DOI10.1142/S1793830921501512zbMath1494.05046OpenAlexW3179850645MaRDI QIDQ5101876

Seog-Jin Kim, Xiaowei Yu

Publication date: 2 September 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501512

zbMATH Keywords

signed graphsigned chromatic numbersigned choice number

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)

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Choosability in signed planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• Colorings and orientations of graphs
• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
• A sufficient condition for DP-4-colorability
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• The chromatic spectrum of signed graphs
• Circular coloring of signed graphs
• A note on a Brooks' type theorem for DP‐coloring

This page was built for publication: Planar graphs without intersecting 5-cycles are signed-4-choosable