Hajós-like theorem for signed graphs

DOI10.1016/j.ejc.2017.08.003zbMath1371.05114arXiv1702.08232OpenAlexW2592224499MaRDI QIDQ2408976

Ying-Li Kang

Publication date: 10 October 2017

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

Full work available at URL: https://arxiv.org/abs/1702.08232

zbMATH Keywords

Hajós theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Hajós and Ore constructions for digraphs

Cites Work

• Degree choosable signed graphs
• Circular flow on signed graphs
• How colorful the signed graph?
• Choosability in signed planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• A Hajós-like theorem for list coloring
• Hajós theorem for colorings of edge-weighted graphs
• The chromatic spectrum of signed graphs
• An analogue of Hajós’ Theorem for the circular chromatic number
• HAJÓS-LIKE THEOREM FOR GROUP COLORING
• Homomorphisms of Signed Graphs

This page was built for publication: Hajós-like theorem for signed graphs