Pages that link to "Item:Q4810505"
From MaRDI portal
The following pages link to Interval bigraphs and circular arc graphs (Q4810505):
Displayed 50 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Biclique graphs of interval bigraphs (Q2184675) (← links)
- Parikh word representability of bipartite permutation graphs (Q2185746) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- A characterization of 2-tree proper interval 3-graphs (Q2249945) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- Biclique graph of bipartite permutation graphs (Q2413146) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- A characterization of triangle-free tolerance graphs (Q2489942) (← links)
- Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
- Structural properties of word representable graphs (Q2630778) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Partial characterizations of circular-arc graphs (Q3652535) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- (Q5197590) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Quasimonotone graphs (Q5918199) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- A characterization of unit interval bigraphs of open and closed intervals (Q6184331) (← links)