Abstract | ||
---|---|---|
The partial representation extension problem, introduced by Klavik et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs. |
Year | Venue | Field |
---|---|---|
2017 | arXiv: Discrete Mathematics | Discrete mathematics,Graph,Combinatorics,Indifference graph,Arc (geometry),Partial k-tree,Mathematics |
DocType | Volume | Citations |
Journal | abs/1706.00928 | 0 |
PageRank | References | Authors |
0.34 | 4 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Peter Zeman | 1 | 6 | 3.14 |