Computing role assignments of chordal graphs
type: Item
instance of: scholarly article
title: Computing role assignments of chordal graphs
zbMATH Open document ID: 1231.05182
author: Pim Van 't Hof
author: Daniël Paulusma
author: Johan M. M. Van Rooij
published in: Theoretical Computer Science
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 5798132
zbMATH Keywords: role assignment
zbMATH Keywords: graph homomorphism
zbMATH Keywords: chordal graph
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.041
OpenAlex ID: W2073528847
cites work: Q4017175
cites work: Finite common coverings of pairs of regular graphs
cites work: Power of Natural Semijoins
cites work: Constructing 5-Arc-Transitive Cubic Graphs
cites work: Q4288578
cites work: Q3416074
cites work: Role colouring a graph
cites work: Q4474120
cites work: Partial covers of graphs
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: A complete complexity classification of the role assignment problem
cites work: Comparing universal covers in polynomial time
cites work: Q4198056
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Covering regular graphs
cites work: Counting the number of independent sets in chordal graphs
cites work: The role assignment model nearly fits most social networks
cites work: Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
cites work: How hard is it to determine if a graph has a 2-role assignment?
cites work: 2-role assignments on triangulated graphs.
DOI: 10.1016/J.TCS.2010.05.041
description: scientific article; zbMATH DE number 5798132