Haj\'os-like theorem for signed graphs
Abstract
The paper designs five graph operations, and proves that every signed graph with chromatic number q can be obtained from all-positive complete graphs (Kq,+) by repeatedly applying these operations. This result gives a signed version of the Haj\'os theorem, emphasizing the role of all-positive complete graphs played in the class of signed graphs, as played in the class of unsigned graphs.
0