How colorful the signed graph?

DOI10.1016/0012-365X(84)90088-8zbMATH Open0554.05026MaRDI QIDQ759762FDOQ759762

Thomas Zaslavsky

Publication date: 1984

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

Recommendations

• The chromatic spectrum of signed graphs
• The chromatic number of a signed graph
• A generalization of Noel-Reed-Wu theorem to signed graphs
• Eigenvalues and chromatic number of a signed graph
• Degree choosable signed graphs

zbMATH Keywords

chromatic numbersigned graphNP-complete problemantibalanced subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Signed graph coloring
• On the notion of balance of a signed graph
• Title not available (Why is that?)
• On the coloring of signed graphs
• Chromatic invariants of signed graphs
• A simple algorithm to detect balance in signed graphs

Cited In (15)

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

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

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