Colouring of generalized signed triangle-free planar graphs

DOI10.1016/j.disc.2018.11.011zbMath1403.05049OpenAlexW2905215200WikidataQ128768050 ScholiaQ128768050MaRDI QIDQ1712532

Xuding Zhu, Daphne Der-Fen Liu, Yeong-Nan Yeh, Yiting Jiang

Publication date: 22 January 2019

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

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

zbMATH Keywords

oriented graphssigned graphstriangle-free planar graphs\(S\)-colouringList colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (4)

Generalized signed graphs of large girth and large chromatic number ⋮ Concepts of signed graph coloring ⋮ A refinement of choosability of graphs ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions

Cites Work

• A note on the not 3-choosability of some families of planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• A not 3-choosable planar graph without 3-cycles

This page was built for publication: Colouring of generalized signed triangle-free planar graphs