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

DOI10.1142/S1793830921501512MaRDI QIDQ5101876zbMATH OpenOpenAlexFDO

Authors 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 choice numbersigned chromatic numbersigned 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)

Recommendations

• Planar graphs without intersecting 5-cycles are 4-choosable
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• Choosability and edge choosability of planar graphs without five cycles
• Edge-choosability of planar graphs without non-induced 5-cycles
• Acyclic 5-choosability of planar graphs without small cycles

Cites work

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

Cited in

(1)

• Choosability in signed planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101876)