Applied combinatorics
Algorithmic aspects of vertex elimination
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Computing role assignments of chordal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Computing role assignments of chordal graphs
Theoretical Computer Science
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
| Hi-index | 5.23 |
If G is a graph, a k-role assignment is a function mapping each vertex into a role, a positive integer 1, 2,...,k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same. A graph is called a triangulated graph if it contains no chord-less cycle of four or more vertices. One interesting type of triangulated graph is the indifference graph, that is a graph for which we can find a function on its vertex set so that if x and y are adjacent, then their assigned function values are close. We study 2-role assignments for triangulated graphs. We provide a "greedy" algorithm for finding a 2-role assignment on a connected, nonbipartite triangulated graph with at most one pendant vertex. We characterize indifference graphs that have a 2-role assignment.