The following pages link to How colorful the signed graph? (Q759762):
Displaying 22 items.
- Coloring signed graphs using DFS (Q276341) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- Configuration and minimal coloring of disbalanced graphs (Q656414) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- Balanced decompositions of a signed graph (Q1092068) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- On the achromatic number of signed graphs (Q1711838) (← links)
- The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring (Q1892835) (← links)
- The chromatic number of joins of signed graphs (Q2053734) (← links)
- Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
- The odd-valued chromatic polynomial of a signed graph (Q2166295) (← links)
- A generalization of Noel-Reed-Wu theorem to signed graphs (Q2174577) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Hajós-like theorem for signed graphs (Q2408976) (← links)
- The chromatic spectrum of signed graphs (Q2629274) (← links)
- EQUILIBRATION OF A HARD-DISKS SYSTEM (Q5474151) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- Symmetric set coloring of signed graphs (Q6114964) (← links)
