2-role assignments on triangulated graphs.
From MaRDI portal
Publication:1401397
DOI10.1016/S0304-3975(03)00084-7zbMATH Open1045.68105OpenAlexW1987474300MaRDI QIDQ1401397FDOQ1401397
Authors: Li Sheng 
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
Recommendations
Cites Work
- Regular equivalence: General theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incidence matrices and interval graphs
- On the compatibility between a graph and a simple order
- Title not available (Why is that?)
- On rigid circuit graphs
- Representation of a finite graph by a set of intervals on the real line
- Role colouring a graph
- How hard is it to determine if a graph has a 2-role assignment?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Betweenness, orders and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- 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 split graphs
- Computing role assignments of proper interval graphs in polynomial time
- Role coloring bipartite graphs
- Title not available (Why is that?)
- Computing role assignments of chordal graphs
- Computing Role Assignments of Chordal Graphs
- Edge homogeneous colorings
This page was built for publication: 2-role assignments on triangulated graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401397)
