Extending partial representations of circular-arc graphs
From MaRDI portal
Publication:6043187
DOI10.1007/978-3-031-15914-5_17arXiv2108.13076MaRDI QIDQ6043187
Jiří Fiala, Peter Stumpf, Peter Zeman, Ignaz Rutter
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.13076
Cites Work
- Extending partial representations of proper and unit interval graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Cyclic ordering is NP-complete
- PC trees and circular-ones arrangements.
- Linear-time recognition of circular-arc graphs
- Extending partial representations of trapezoid graphs
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Normal Helly circular-arc graphs and its subclasses
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- Extending partial representations of subclasses of chordal graphs
- Incidence matrices and interval graphs
- Extending partial representations of interval graphs
- Matrix characterizations of circular-arc graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Structure theorems for some circular-arc graphs
- Extending Partial Representations of Function Graphs and Permutation Graphs
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
- Proper Helly Circular-Arc Graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- An Efficient Test for Circular-Arc Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Algorithms on circular-arc graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Testing Planarity of Partially Embedded Graphs
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Extending partial representations of circle graphs
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
This page was built for publication: Extending partial representations of circular-arc graphs
