Extending partial representations of circle graphs
DOI10.1007/978-3-319-03841-4_12zbMATH Open1406.68070OpenAlexW1711136171MaRDI QIDQ2867650FDOQ2867650
Authors: Steven Chaplick, Radoslav Fulek, Pavel Klavík
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_12
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (11)
- Minimal obstructions for partial representations of interval graphs
- Extending partial representations of trapezoid graphs
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
- Title not available (Why is that?)
- Extending partial representations of function graphs and permutation graphs
- Contact representations of planar graphs: extending a partial representation is hard
- Simultaneous representation of proper and unit interval graphs
- On the classes of interval graphs of limited nesting and count of lengths
- Extending partial representations of subclasses of chordal graphs
- Extending Partial Representations of Subclasses of Chordal Graphs
- Minimal obstructions for partial representations of interval graphs
This page was built for publication: Extending partial representations of circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867650)