Pages that link to "Item:Q708211"
From MaRDI portal
The following pages link to Computing role assignments of chordal graphs (Q708211):
Displaying 17 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← 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)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Computing Role Assignments of Chordal Graphs (Q3183609) (← links)
- (Q4247695) (← links)
- Edge homogeneous colorings (Q5033097) (← links)
- Computing role assignments of Cartesian product of graphs (Q6050574) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
