Interval digraphs: An analogue of interval graphs

DOI10.1002/JGT.3190130206zbMATH Open0671.05039OpenAlexW2159377379MaRDI QIDQ3824435FDOQ3824435

Authors:

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130206

Recommendations

• Chronological orderings of interval digraphs
• An interval digraph in relation to its associated bipartite graph
• scientific article; zbMATH DE number 861315
• scientific article; zbMATH DE number 1043913
• A class of interval digraphs

zbMATH Keywords

intersection graphinterval graphFerrers digraphsIntersection digraphsInterval digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Incidence matrices and interval graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Interval graphs and interval orders
• The Representation of a Graph by Set Intersections

Cited In (70)

• Cliques that are tolerance digraphs
• Representation characterizations of chordal bipartite graphs
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
• Graphs and digraphs represented by intervals and circular arcs
• On some subclasses of interval catch digraphs
• A characterization of interval catch digraphs
• Title not available (Why is that?)
• Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
• Algorithms for interval catch digraphs
• Boolean rank of upset tournament matrices
• Colouring, constraint satisfaction, and complexity
• Ferrers dimension and boxicity
• Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
• Circular-arc bigraphs and its subclasses
• The interval order polytope of a digraph
• An interval digraph in relation to its associated bipartite graph
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Short proofs for interval digraphs
• On the complexity of directed intersection representation of DAGs
• A class of interval digraphs
• On the intractability landscape of digraph intersection representations
• Hamiltonian problems in directed graphs with simple row patterns
• Title not available (Why is that?)
• Adjacency matrices of probe interval graphs
• A remark on signed posets and signed graphs
• 2-nested matrices: towards understanding the structure of circle graphs
• Interval-like graphs and digraphs
• Uniquely restricted matchings in interval graphs
• Chronological rectangle digraphs
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
• Recognition and characterization of chronological interval digraphs
• Chronological orderings of interval digraphs
• A recognition algorithm for adjusted interval digraphs
• New characterizations of proper interval bigraphs
• Forbidden substructure for interval digraphs/bigraphs
• A class of acyclic digraphs with interval competition graphs
• A characterization of triangle-free tolerance graphs
• Adjusted interval digraphs
• Extension of one-dimensional proximity regions to higher dimensions
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• Characterizations of two classes of digraphs
• Permutation bigraphs and interval containments
• Line digraphs and coreflexive vertex sets
• A characterization of 2-tree proper interval 3-graphs
• Homogeneously Representable Interval Bigraphs
• On the distribution of the domination number for random class cover catch digraphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
• Miscellaneous digraph classes
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• Strict chordal and strict split digraphs
• Interval \(k\)-graphs and orders
• Representing digraphs using intervals or circular arcs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asteroidal Triple of Edges in Bichordal Graphs: A Complete list
• On central max-point-tolerance graphs
• Transformations of digraphs viewed as intersection digraphs
• On characterizing proper max-point-tolerance graphs
• Min-orderable digraphs
• Comparability digraphs: an analogue of comparability graphs
• Recognizing interval bigraphs by forbidden patterns
• Title not available (Why is that?)
• On the kernel and related problems in interval digraphs
• Bipartite Analogues of Comparability and Cocomparability Graphs
• Classes of intersection digraphs with good algorithmic properties
• Bi-arc digraphs: recognition algorithm and applications
• Gender-aware facility location in multi-gender world

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)