Graphs and digraphs represented by intervals and circular arcs
From MaRDI portal
Publication:2357159
DOI10.1016/j.dam.2016.11.004zbMath1365.05107OpenAlexW2592742719MaRDI QIDQ2357159
Ritapa Chakraborty, Ashok Kumar Das
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.004
circular arc graphthreshold graphproper interval bigraphcircular arc digraphproper circular arc bigraph
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two remarks on circular arc graphs
- New characterizations of proper interval bigraphs
- Forbidden substructure for interval digraphs/bigraphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Bipartite permutation graphs
- Connection digraphs and second-order line digraphs
- Linear-time recognition of circular-arc graphs
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Representing digraphs using intervals or circular arcs
- List homomorphisms and circular arc graphs
- Matrix characterizations of circular-arc graphs
- Structure theorems for some circular-arc graphs
- Interval digraphs: An analogue of interval graphs
- An Efficient Test for Circular-Arc Graphs
- Circular‐arc digraphs: A characterization
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval bigraphs and circular arc graphs
- The recognition of indifference digraphs and generalized semiorders
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Circular‐Arc Bigraphs and Its Subclasses
- Characterizing circular-arc graphs
