The following pages link to Role colouring a graph (Q1177106):
Displaying 31 items.
- Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Technology driven organizational structure of the firm (Q665834) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Defining and measuring trophic role similarity in food webs using regular equivalence (Q2177069) (← links)
- Complexity of stability (Q2237893) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- How hard is it to determine if a graph has a 2-role assignment? (Q2714905) (← links)
- Mike Fellows: Weaving the Web of Mathematics and Adventure (Q2908534) (← 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)
- Edge homogeneous colorings (Q5033097) (← links)
- Homogeneous colourings of graphs (Q5878484) (← links)
- The role assignment model nearly fits most social networks (Q5939411) (← links)
- Complexity of Stability. (Q6065416) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
