How colorful the signed graph?

DOI10.1016/0012-365X(84)90088-8zbMath0554.05026MaRDI QIDQ759762

Thomas Zaslavsky

Publication date: 1984

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

zbMATH Keywords

chromatic numbersigned graphNP-complete problemantibalanced subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

The chromatic spectrum of signed graphs ⋮ Balanced decompositions of a signed graph ⋮ The complexity of signed graph and edge-coloured graph homomorphisms ⋮ Hajós-like theorem for signed graphs ⋮ Choosability in signed planar graphs ⋮ Symmetric set coloring of signed graphs ⋮ The chromatic number of a signed graph ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ Homomorphisms of signed graphs: an update ⋮ Concepts of signed graph coloring ⋮ Degree choosable signed graphs ⋮ EQUILIBRATION OF A HARD-DISKS SYSTEM ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Edge coloring of the signed generalized Petersen graph

Cites Work

• Unnamed Item
• Unnamed Item
• Signed graph coloring
• A simple algorithm to detect balance in signed graphs
• Chromatic invariants of signed graphs
• On the coloring of signed graphs
• On the notion of balance of a signed graph

This page was built for publication: How colorful the signed graph?