Interval bigraphs and circular arc graphs
From MaRDI portal
Publication:4810505
DOI10.1002/jgt.20006zbMath1046.05066OpenAlexW4255798272MaRDI QIDQ4810505
Publication date: 16 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20006
interval graphsproper interval graphscircular arc graphsproper circular arc graphsasteroidal triplesinterval bigraphsproper interval bigraphsedge asteroids
Related Items
Subclasses of circular-arc bigraphs: Helly, normal and proper ⋮ Unnamed Item ⋮ Structural properties of word representable graphs ⋮ Ferrers dimension of grid intersection graphs ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Circular‐Arc Bigraphs and Its Subclasses ⋮ On orthogonal ray graphs ⋮ Adjacency matrices of probe interval graphs ⋮ Biclique graph of bipartite permutation graphs ⋮ Biclique graphs of interval bigraphs ⋮ Parikh word representability of bipartite permutation graphs ⋮ Permutation bigraphs and interval containments ⋮ Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs ⋮ Recognizing interval bigraphs by forbidden patterns ⋮ New characterizations of proper interval bigraphs ⋮ Graph classes with and without powers of bounded clique-width ⋮ Forbidden substructure for interval digraphs/bigraphs ⋮ Critical properties of bipartite permutation graphs ⋮ A dichotomy for minimum cost graph homomorphisms ⋮ A characterization of unit interval bigraphs of open and closed intervals ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ Normal Helly circular-arc graphs and its subclasses ⋮ Bipartite Analogues of Comparability and Cocomparability Graphs ⋮ A min-max property of chordal bipartite graphs with applications ⋮ Min-Orderable Digraphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Boxicity of circular arc graphs ⋮ Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Non-edge orientation and vertex ordering characterizations of some classes of bigraphs ⋮ A characterization of 2-tree proper interval 3-graphs ⋮ End-vertices of LBFS of (AT-free) bigraphs ⋮ Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs ⋮ Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs ⋮ A characterization of triangle-free tolerance graphs ⋮ Obstacle numbers of graphs ⋮ Representation characterizations of chordal bipartite graphs ⋮ Lucky labelings of graphs ⋮ Quasimonotone graphs ⋮ Interval \(k\)-graphs and orders ⋮ Simple Geometrical Intersection Graphs ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs ⋮ Minimum Cost Homomorphisms with Constrained Costs ⋮ Counting Perfect Matchings and the Switch Chain ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Partial characterizations of circular-arc graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Strong Chordality of Graphs with Possible Loops ⋮ Linear-time recognition of double-threshold graphs ⋮ Graphs and digraphs represented by intervals and circular arcs
Cites Work
