Skip to main navigation Skip to search Skip to main content

Extending Partial Representations of Circle Graphs

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R' giving some pre-drawn chords that represent an induced subgraph of G. The question is whether one can extend R' to a representation R of the entire G, i.e., whether one can draw the remaining chords into a partially pre-drawn representation. Our main result is a polynomial-time algorithm for partial representation extension of circle graphs. To show this, we describe the structure of all representation a circle graph based on split decomposition. This can be of an independent interest.

Original languageEnglish
Title of host publicationGraph Drawing - 21st International Symposium, GD 2013, Revised Selected Papers
EditorsS. Wismath, A. Wolff
PublisherSpringer, Cham
Pages131-142
Number of pages12
ISBN (Electronic)9783319038414
ISBN (Print)9783319038407
DOIs
Publication statusPublished - 2013
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume8242
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Extending Partial Representations of Circle Graphs'. Together they form a unique fingerprint.
  • Extending partial representations of circle graphs

    Chaplick, S., Fulek, R. & Klavík, P., Aug 2019, In: Journal of Graph Theory. 91, 4, p. 365-394 30 p.

    Research output: Contribution to journal › Article › Academic › peer-review

Cite this