Coloring permutation-gain graphs

DOI10.11575/CDM.V16I1.62717MaRDI QIDQ4986271zbMATH OpenOpenAlexFDO

Authors Daniel Slilaty

Publication date 27 April 2021

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

zbMATH Keywords

list coloringplanar graphscorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Totally frustrated states in the chromatic theory of gain graphs
• An elementary chromatic reduction for gain graphs and special hyperplane arrangements
• Generalized signed graphs of large girth and large chromatic number
• The chromatic number of a signed graph
• scientific article; zbMATH DE number 3875312

Cites work

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

Cited in

(2)

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

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

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