How colorful the signed graph?
type: Item
instance of: scholarly article
title: How colorful the signed graph?
zbMATH Open document ID: 0554.05026
DOI: 10.1016/0012-365X(84)90088-8
author: Thomas Zaslavsky
published in: Discrete Mathematics
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3882455
zbMATH Keywords: chromatic number
zbMATH Keywords: signed graph
zbMATH Keywords: antibalanced subgraph
zbMATH Keywords: NP-complete problem
MaRDI profile type: Publication
cites work: On the coloring of signed graphs
cites work: Q4198056
cites work: On the notion of balance of a signed graph
cites work: A simple algorithm to detect balance in signed graphs
cites work: Q5799732
cites work: Signed graph coloring
cites work: Chromatic invariants of signed graphs
description: scientific article; zbMATH DE number 3882455