Pages that link to "Item:Q3824435"

The following pages link to Interval digraphs: An analogue of interval graphs (Q3824435):

Displaying 50 items.

• On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
• Chronological rectangle digraphs (Q324764) (← links)
• Recognition and characterization of chronological interval digraphs (Q396800) (← links)
• Permutation bigraphs and interval containments (Q401140) (← links)
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
• Boolean rank of upset tournament matrices (Q417452) (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• Strict chordal and strict split digraphs (Q516787) (← links)
• Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← links)
• Adjacency matrices of probe interval graphs (Q608289) (← links)
• Ferrers dimension and boxicity (Q708404) (← links)
• New characterizations of proper interval bigraphs (Q896097) (← links)
• Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
• Extension of one-dimensional proximity regions to higher dimensions (Q991185) (← links)
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data (Q998418) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• A characterization of interval catch digraphs (Q1118608) (← links)
• The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
• An interval digraph in relation to its associated bipartite graph (Q1313853) (← links)
• Algorithms for interval catch digraphs (Q1329814) (← links)
• Characterizations of two classes of digraphs (Q1336693) (← links)
• Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
• Short proofs for interval digraphs (Q1377823) (← links)
• Cliques that are tolerance digraphs (Q1382269) (← links)
• Line digraphs and coreflexive vertex sets (Q1584342) (← links)
• Interval \(k\)-graphs and orders (Q1789058) (← links)
• Representing digraphs using intervals or circular arcs (Q1910520) (← links)
• On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
• Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
• 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
• On the intractability landscape of digraph intersection representations (Q2169961) (← links)
• A characterization of 2-tree proper interval 3-graphs (Q2249945) (← links)
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
• Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
• Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
• A class of acyclic digraphs with interval competition graphs (Q2486750) (← links)
• A characterization of triangle-free tolerance graphs (Q2489942) (← links)
• Chronological orderings of interval digraphs (Q2497527) (← links)
• Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
• A recognition algorithm for adjusted interval digraphs (Q2656971) (← links)
• Adjusted interval digraphs (Q2839215) (← links)
• Miscellaneous Digraph Classes (Q3120443) (← links)
• Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
• (Q3172287) (← links)
• Gender-aware facility location in multi-gender world (Q3301019) (← links)
• Asteroidal Triple of Edges in Bichordal Graphs: A Complete list (Q3439034) (← links)
• Homogeneously Representable Interval Bigraphs (Q3439038) (← links)
• (Q4273847) (← links)
• Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)