How colorful the signed graph?

DOI10.1016/0012-365X(84)90088-8MaRDI QIDQ759762zbMATH OpenFDO

Authors Thomas Zaslavsky

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(84)90088-8

zbMATH Keywords

antibalanced subgraphchromatic numberNP-complete problemsigned graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cites work

• A simple algorithm to detect balance in signed graphs
• Chromatic invariants of signed graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• On the coloring of signed graphs
• On the notion of balance of a signed graph
• Signed graph coloring

Cited in

(28)

• Balanced decompositions of a signed graph
• Extracting pure network submatrices in linear programs using signed graphs.
• On the achromatic number of signed graphs
• The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring
• The chromatic number of joins of signed graphs
• Edge coloring of the signed generalized Petersen graph
• The odd-valued chromatic polynomial of a signed graph
• A generalization of Noel-Reed-Wu theorem to signed graphs
• Homomorphisms of signed graphs: an update
• Concepts of signed graph coloring
• The complexity of signed graph and edge-coloured graph homomorphisms
• Hajós-like theorem for signed graphs
• The chromatic spectrum of signed graphs
• Coloring signed graphs using DFS
• A note on the vertex arboricity of signed graphs
• Coloring problem of signed interval graphs
• Chromatic polynomials of signed book graphs
• Degree choosable signed graphs
• EQUILIBRATION OF A HARD-DISKS SYSTEM
• Signed colouring and list colouring of k‐chromatic graphs
• Symmetric set coloring of signed graphs
• Signed Ramsey numbers
• Configuration and minimal coloring of disbalanced graphs
• Edge coloring of products of signed graphs
• The homomorphism and coloring of the direct product of signed graphs
• Complexity of planar signed graph homomorphisms to cycles
• Choosability in signed planar graphs
• The chromatic number of a signed graph

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)