A characterization of uniquely representable two-directional orthogonal ray graphs
From MaRDI portal
Cites work
- O(M\cdot N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
- A characterization of uniquely representable interval graphs
- Algorithmic graph theory and perfect graphs
- An O(n2) Algorithm for Undirected Split Decomposition
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Circular-arc graphs with clique cover number two
- Counting Interval Graphs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 437537 (Why is no real title available?)
- List homomorphisms and circular arc graphs
- Min-orderable digraphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- On orthogonal ray graphs
- On the 2-Chain Subgraph Cover and Related Problems
- Permutation bigraphs and interval containments
- Representation characterizations of chordal bipartite graphs
- The Complexity of the Partial Order Dimension Problem
- Two remarks on circular arc graphs
- Uniquely orderable interval graphs
This page was built for publication: A characterization of uniquely representable two-directional orthogonal ray graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970723)
