Extending Partial Representations of Unit Circular-arc Graphs
classification
💻 cs.DM
keywords
problemcircular-arcgraphspartialunitextendingextensiongeneralizes
read the original abstract
The partial representation extension problem, introduced by Klav\'{i}k et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.