Coloring permutation-gain graphs

DOI10.11575/cdm.v16i1.62717zbMath1462.05146OpenAlexW3157933016MaRDI QIDQ4986271

Daniel C. Slilaty

Publication date: 27 April 2021

Full work available at URL: https://cdm.ucalgary.ca/article/download/62717/54765

zbMATH Keywords

planar graphslist coloringcorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On colorings and orientations of signed graphs ⋮ Symmetric set coloring of signed graphs

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The chromatic number of a signed graph
• Signed graph coloring
• A sufficient condition for DP-4-colorability
• DP-colorings of graphs with high chromatic number
• The chromatic spectrum of signed graphs

This page was built for publication: Coloring permutation-gain graphs