Pages that link to "Item:Q287443"
From MaRDI portal
The following pages link to Computing role assignments of split graphs (Q287443):
Displaying 10 items.
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- On the number of maximal independent sets in minimum colorings of split graphs (Q1671359) (← links)
- Role colouring graphs in hereditary classes (Q2034782) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- How hard is it to determine if a graph has a 2-role assignment? (Q2714905) (← links)
- Computing Role Assignments of Chordal Graphs (Q3183609) (← links)
- (Q4247695) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)