Pages that link to "Item:Q4857436"
From MaRDI portal
The following pages link to Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436):
Displaying 15 items.
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A classification of locally semicomplete digraphs (Q1356448) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Obstructions for acyclic local tournament orientation completions (Q2099464) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Quasi‐transitive digraphs (Q4852401) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
