Interval digraphs: An analogue of interval graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(79)- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- A characterization of interval catch digraphs
- The forbidden subgraph characterization of directed vertex graphs
- An interval digraph in relation to its associated bipartite graph
- Algorithms for interval catch digraphs
- Characterizations of two classes of digraphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Cliques that are tolerance digraphs
- On the distribution of the domination number for random class cover catch digraphs
- Line digraphs and coreflexive vertex sets
- Interval \(k\)-graphs and orders
- Representing digraphs using intervals or circular arcs
- On the complexity of directed intersection representation of DAGs
- Hamiltonian problems in directed graphs with simple row patterns
- 2-nested matrices: towards understanding the structure of circle graphs
- On the intractability landscape of digraph intersection representations
- A characterization of 2-tree proper interval 3-graphs
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs
- Graphs and digraphs represented by intervals and circular arcs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- A class of acyclic digraphs with interval competition graphs
- A characterization of triangle-free tolerance graphs
- Chronological orderings of interval digraphs
- Representation characterizations of chordal bipartite graphs
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- A recognition algorithm for adjusted interval digraphs
- Adjusted interval digraphs
- Miscellaneous digraph classes
- scientific article; zbMATH DE number 1002183 (Why is no real title available?)
- Uniquely restricted matchings in interval graphs
- scientific article; zbMATH DE number 5954122 (Why is no real title available?)
- Chronological rectangle digraphs
- Gender-aware facility location in multi-gender world
- Asteroidal Triple of Edges in Bichordal Graphs: A Complete list
- Homogeneously Representable Interval Bigraphs
- scientific article; zbMATH DE number 4168705 (Why is no real title available?)
- A class of interval digraphs
- A remark on signed posets and signed graphs
- Recognition and characterization of chronological interval digraphs
- Permutation bigraphs and interval containments
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- Boolean rank of upset tournament matrices
- scientific article; zbMATH DE number 475591 (Why is no real title available?)
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- scientific article; zbMATH DE number 1735663 (Why is no real title available?)
- scientific article; zbMATH DE number 1043913 (Why is no real title available?)
- scientific article; zbMATH DE number 1156626 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- Intersection representation of digraphs in trees with few leaves
- scientific article; zbMATH DE number 861315 (Why is no real title available?)
- scientific article; zbMATH DE number 927077 (Why is no real title available?)
- On central max-point-tolerance graphs
- Interval-like graphs and digraphs
- On some subclasses of interval catch digraphs
- The interval order polytope of a digraph
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Min-orderable digraphs
- Strict chordal and strict split digraphs
- Circular-arc bigraphs and its subclasses
- Transformations of digraphs viewed as intersection digraphs
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
- scientific article; zbMATH DE number 2234921 (Why is no real title available?)
- Recognizing interval bigraphs by forbidden patterns
- Adjacency matrices of probe interval graphs
- On the kernel and related problems in interval digraphs
- On characterizing proper max-point-tolerance graphs
- Comparability digraphs: an analogue of comparability graphs
- Classes of intersection digraphs with good algorithmic properties
- Bi-arc digraphs: recognition algorithm and applications
- Line digraphs of polytrees
- Veto interval graphs and variations
- On some subclasses of oriented catch digraphs
- Ferrers dimension and boxicity
- Interval k-graphs : recognition and forbidden obstructions
- New characterizations of proper interval bigraphs
- Forbidden substructure for interval digraphs/bigraphs
- Extension of one-dimensional proximity regions to higher dimensions
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
This page was built for publication: Interval digraphs: An analogue of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3824435)
