2-role assignments on triangulated graphs.
From MaRDI portal
Publication:1401397
DOI10.1016/S0304-3975(03)00084-7zbMath1045.68105OpenAlexW1987474300MaRDI QIDQ1401397
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00084-7
Related Items (7)
Edge homogeneous colorings ⋮ Computing role assignments of split graphs ⋮ On the complexity of role colouring planar graphs, trees and cographs ⋮ Computing role assignments of proper interval graphs in polynomial time ⋮ Computing Role Assignments of Proper Interval Graphs in Polynomial Time ⋮ Computing role assignments of chordal graphs ⋮ Role coloring bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Role colouring a graph
- Incidence matrices and interval graphs
- On the compatibility between a graph and a simple order
- Betweenness, orders and interval graphs
- How hard is it to determine if a graph has a 2-role assignment?
- Representation of a finite graph by a set of intervals on the real line
- Regular equivalence: General theory
This page was built for publication: 2-role assignments on triangulated graphs.
