Role colouring a graph

DOI10.1016/0165-4896(91)90080-BMaRDI QIDQ1177106zbMATH OpenOpenAlexFDO

Authors Martin G. Everett, Steve Borgatti

Publication date 26 June 1992

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(91)90080-b

zbMATH Keywords

latticeautomorphism grouprole colouring

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• scientific article; zbMATH DE number 1008448
• On the complexity of role colouring planar graphs, trees and cographs
• scientific article; zbMATH DE number 1302393
• Role coloring bipartite graphs

Cited in

(32)

• Complexity of Stability.
• Technology driven organizational structure of the firm
• Parameterizing role coloring on forests
• On the complexity of role colouring planar graphs, trees and cographs
• Comparing Universal Covers in Polynomial Time
• Computing role assignments of proper interval graphs in polynomial time
• Mike Fellows: Weaving the Web of Mathematics and Adventure
• Assignment games, chromatic number, and exchange theory
• An algorithmic framework for locally constrained homomorphisms
• Structural similarity: spectral methods for relaxed blockmodeling
• Computing role assignments of split graphs
• Complexity of stability
• Computing role assignments of proper interval graphs in polynomial time
• Homogeneous colourings of graphs
• Role coloring bipartite graphs
• Computing role assignments of chordal graphs
• A complete complexity classification of the role assignment problem
• The role assignment model nearly fits most social networks
• Comparing universal covers in polynomial time
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Locally constrained graph homomorphisms and equitable partitions
• 2-role assignments on triangulated graphs.
• Cantor--Bernstein type theorem for locally constrained graph homomorphisms
• Obtaining online ecological colourings by generalizing first-fit
• Regular equivalence: General theory
• Defining and measuring trophic role similarity in food webs using regular equivalence
• An algorithmic framework for locally constrained homomorphisms
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• How hard is it to determine if a graph has a 2-role assignment?
• Edge homogeneous colorings
• On the computational complexity of partial covers of theta graphs
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices

This page was built for publication: Role colouring a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177106)