Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3871363 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 3593613 (Why is no real title available?)
- scientific article; zbMATH DE number 1302393 (Why is no real title available?)
- scientific article; zbMATH DE number 1151838 (Why is no real title available?)
- scientific article; zbMATH DE number 1983913 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- Betweenness, orders and interval graphs
- How hard is it to determine if a graph has a 2-role assignment?
- Incidence matrices and interval graphs
- On rigid circuit graphs
- On the compatibility between a graph and a simple order
- Regular equivalence: General theory
- Representation of a finite graph by a set of intervals on the real line
- Role colouring a graph
Cited in
(9)- Computing role assignments of chordal graphs
- Computing Role Assignments of Chordal Graphs
- Computing role assignments of split graphs
- Computing role assignments of proper interval graphs in polynomial time
- Role coloring bipartite graphs
- On the complexity of role colouring planar graphs, trees and cographs
- Edge homogeneous colorings
- scientific article; zbMATH DE number 1302393 (Why is no real title available?)
- Computing role assignments of proper interval graphs in polynomial time
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)
