How colorful the signed graph?
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- 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
- Signed graph coloring
Cited in
(25)- The chromatic number of joins of signed graphs
- EQUILIBRATION OF A HARD-DISKS SYSTEM
- Coloring signed graphs using DFS
- Concepts of signed graph coloring
- The odd-valued chromatic polynomial of a signed graph
- Edge coloring of the signed generalized Petersen graph
- Complexity of planar signed graph homomorphisms to cycles
- Hajós-like theorem for signed graphs
- Homomorphisms of signed graphs: an update
- Signed Ramsey numbers
- On the achromatic number of signed graphs
- Extracting pure network submatrices in linear programs using signed graphs.
- Chromatic polynomials of signed book graphs
- Choosability in signed planar graphs
- A note on the vertex arboricity of signed graphs
- Balanced decompositions of a signed graph
- A generalization of Noel-Reed-Wu theorem to signed graphs
- Symmetric set coloring of signed graphs
- 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
- Degree choosable signed graphs
- Configuration and minimal coloring of disbalanced graphs
- Coloring problem of signed interval 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)
