The following pages link to On the coloring of signed graphs (Q2527135):
Displaying 23 items.
- On purely tree-colorable planar graphs (Q280945) (← links)
- How colorful the signed graph? (Q759762) (← links)
- Size of edge-critical uniquely 3-colorable planar graphs (Q906468) (← links)
- Unique graph homomorphisms onto odd cycles. II (Q919003) (← links)
- Some classes of uniquely 3-colorable graphs (Q1212948) (← links)
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs (Q1229733) (← links)
- Uniquely colorable graphs (Q1250828) (← links)
- Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
- A categorification for the signed chromatic polynomial (Q2152787) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- A note on a matrix criterion for unique colorability of a signed graph (Q2535987) (← links)
- Uniquely k-arborable graphs (Q2548256) (← links)
- The size of uniquely colorable graphs (Q2641312) (← links)
- Chordal multipartite graphs and chordal colorings (Q2643326) (← links)
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications (Q2686135) (← links)
- Graph Models For Social Relations (Q2839248) (← links)
- Stable configurations in social networks (Q4569231) (← links)
- (Q5206906) (← links)
- On the number of balanced signed graphs (Q5543329) (← links)
- Uniquely colorable graphs with equal chromatic and game chromatic numbers (Q5866017) (← links)
- Graph theory (Q5917392) (← links)
- On colorings and orientations of signed graphs (Q6063839) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
