Computing Role Assignments of Chordal Graphs
From MaRDI portal
Recommendations
- Computing role assignments of chordal graphs
- Computing role assignments of split graphs
- Computing role assignments of Cartesian product of graphs
- Computing some role assignments of Cartesian product of graphs
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of proper interval graphs in polynomial time
- scientific article; zbMATH DE number 1302393
- 2-role assignments on triangulated graphs.
- scientific article; zbMATH DE number 2038757
- scientific article; zbMATH DE number 1533813
Cited in
(13)- On the complexity of role colouring planar graphs, trees and cographs
- Computing some role assignments of Cartesian product of graphs
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of split graphs
- scientific article; zbMATH DE number 2038757 (Why is no real title available?)
- Computing role assignments of Cartesian product of graphs
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of chordal graphs
- scientific article; zbMATH DE number 1302393 (Why is no real title available?)
- A complete complexity classification of the role assignment problem
- The role assignment model nearly fits most social networks
- How hard is it to determine if a graph has a 2-role assignment?
- Study on \((r+1)\)-role assignments of complementary prisms, with \(r\ge 3\)
This page was built for publication: Computing Role Assignments of Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183609)