Circular‐Arc Bigraphs and Its Subclasses
From MaRDI portal
Publication:5325948
DOI10.1002/jgt.21681zbMath1269.05025OpenAlexW1590899249MaRDI QIDQ5325948
Sandip Das, Shamik Ghosh, Asim Basu, Malay Kr. Sen
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21681
interval graphcircular-arc graphFerrers dimensioninterval bigraphFerrers bigraphproper circular-arc graphunit circular-arc graph
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Subclasses of circular-arc bigraphs: Helly, normal and proper, 2-nested matrices: towards understanding the structure of circle graphs, On some subclasses of interval catch digraphs, On characterizing proper max-point-tolerance graphs, Non-edge orientation and vertex ordering characterizations of some classes of bigraphs, Oriented bipartite graphs and the Goldbach graph, On central max-point-tolerance graphs, Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs, Graphs and digraphs represented by intervals and circular arcs
Cites Work
- Two remarks on circular arc graphs
- Ferrers dimension and boxicity
- Circular-arc graphs with clique cover number two
- Linear-time recognition of circular-arc graphs
- Representing digraphs using intervals or circular arcs
- Representation characterizations of chordal bipartite graphs
- Matrix characterizations of circular-arc graphs
- Structure theorems for some circular-arc graphs
- Interval digraphs: An analogue of interval graphs
- Coloring a Family of Circular Arcs
- Circular‐arc digraphs: A characterization
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval bigraphs and circular arc graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Polynomial time recognition of unit circular-arc graphs
- Difference graphs
