Pages that link to "Item:Q1377666"
From MaRDI portal
The following pages link to Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666):
Displayed 39 items.
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Boolean rank of upset tournament matrices (Q417452) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← 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)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- On orthogonal ray trees (Q908312) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Interval bigraphs are unit grid intersection graphs (Q1024491) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← 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)
- Biclique graphs of interval bigraphs (Q2184675) (← links)
- A characterization of 2-tree proper interval 3-graphs (Q2249945) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- Chordal multipartite graphs and chordal colorings (Q2643326) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Adjusted Interval Digraphs (Q2839215) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- Asteroidal Triple of Edges in Bichordal Graphs: A Complete list (Q3439034) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← 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)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)