Colouring of S-labelled planar graphs

DOI10.1016/J.EJC.2020.103198MaRDI QIDQ2225437zbMATH OpenOpenAlexFDO

Authors Li-Gang Jin, Tsai-Lien Wong, Xuding Zhu

Publication date 8 February 2021

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

Full work available at URL https://doi.org/10.1016/j.ejc.2020.103198

zbMATH Keywords

chromatic number of a signed graphnon-4-colourable signed planar graphnon-\(Z_4\)-colourable signed planargraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• 4-colouring of generalized signed planar graphs
• Colouring of generalized signed triangle-free planar graphs
• Generalized signed graphs of large girth and large chromatic number
• A refinement of choosability of graphs
• A note on complex-4-colorability of signed planar graphs

Cites work

• A note on group colorings
• A refinement of choosability of graphs
• Biased graphs. III: Chromatic and dichromatic invariants
• Circular coloring of signed graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Homomorphisms of signed graphs
• Signed graph coloring
• The chromatic number of a signed graph
• The chromatic spectrum of signed graphs

Cited in

(7)

• Signed permutations and the four color theorem
• Colouring of generalized signed triangle-free planar graphs
• Generalized signed graphs of large girth and large chromatic number
• 4-colouring of generalized signed planar graphs
• Signed colouring and list colouring of k‐chromatic graphs
• Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
• A note on complex-4-colorability of signed planar graphs

This page was built for publication: Colouring of \(S\)-labelled planar graphs

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