The following pages link to Role colouring a graph (Q1177106):
Displayed 14 items.
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- (Q2714905) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Assignment games, chromatic number, and exchange theory (Q4693220) (← links)
- Regular equivalence: General theory (Q4853973) (← links)
- The role assignment model nearly fits most social networks (Q5939411) (← links)