Interval bigraphs and circular arc graphs
From MaRDI portal
Recommendations
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
- Circular-arc bigraphs and its subclasses
- Characterizations for unit interval bigraphs
- Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
Cites work
Cited in
(62)- Normal Helly circular-arc graphs and its subclasses
- Biclique graphs of interval bigraphs
- Strong Chordality of Graphs with Possible Loops
- scientific article; zbMATH DE number 2170335 (Why is no real title available?)
- Representation characterizations of chordal bipartite graphs
- scientific article; zbMATH DE number 5954122 (Why is no real title available?)
- Biclique graph of bipartite permutation graphs
- On Restrictions of Balanced 2-Interval Graphs
- scientific article; zbMATH DE number 1990726 (Why is no real title available?)
- Graphs and digraphs represented by intervals and circular arcs
- scientific article; zbMATH DE number 4043897 (Why is no real title available?)
- Simple Geometrical Intersection Graphs
- Critical properties of bipartite permutation graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Boxicity of circular arc graphs
- Counting perfect matchings and the switch chain
- Obstacle numbers of graphs
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Circular-arc bigraphs and its subclasses
- Lucky labelings of graphs
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
- Linear-time recognition of double-threshold graphs
- On orthogonal ray graphs
- Subclasses of circular-arc bigraphs: Helly, normal and proper
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Minimum cost homomorphisms with constrained costs
- Min-orderable digraphs
- Tractabilities and intractabilities on geometric intersection graphs
- Parikh word representability of bipartite permutation graphs
- scientific article; zbMATH DE number 1990673 (Why is no real title available?)
- Adjacency matrices of probe interval graphs
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Recognizing interval bigraphs by forbidden patterns
- A min-max property of chordal bipartite graphs with applications
- Bipartite Analogues of Comparability and Cocomparability Graphs
- A characterization of unit interval bigraphs of open and closed intervals
- Essential obstacles to Helly circular-arc graphs
- Minimum Cost Homomorphisms to Reflexive Digraphs
- Paths in interval graphs and circular arc graphs
- New characterizations of proper interval bigraphs
- Graph classes with and without powers of bounded clique-width
- Forbidden substructure for interval digraphs/bigraphs
- A characterization of triangle-free tolerance graphs
- Structural properties of word representable graphs
- Quasimonotone graphs
- Ferrers dimension of grid intersection graphs
- Permutation bigraphs and interval containments
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Asteroidal-triple-free interval \(k\)-graphs
- Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs
- A characterization of 2-tree proper interval 3-graphs
- Modification problems toward proper (Helly) circular-arc graphs
- Partial characterizations of circular-arc graphs
- Subclass hierarchy on circular arc bigraphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- A dichotomy for minimum cost graph homomorphisms
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
- Interval \(k\)-graphs and orders
- Bi-arc digraphs: recognition algorithm and applications
- End-vertices of LBFS of (AT-free) bigraphs
This page was built for publication: Interval bigraphs and circular arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810505)
