scientific article; zbMATH DE number 3815694

MaRDI QIDQ3663338zbMATH OpenFDO

Authors Jerald A. Kabell, Frank Harary, F. R. McMorris

Publication date 1982

Full work available at URL https://eudml.org/doc/17218

zbMATH Keywords

bi-interval graphbi-subtree graphinterval graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cited in

(21)

• Interval bigraphs are unit grid intersection graphs
• Bi-complement reducible graphs
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Short proofs for interval digraphs
• Line digraphs and coreflexive vertex sets
• List matrix partitions of graphs representing geometric configurations
• Modular intersection graphs
• Chordal digraphs
• A min-max property of chordal bipartite graphs with applications
• Biclique graphs of interval bigraphs
• A characterization of 2-tree proper interval 3-graphs
• Representation characterizations of chordal bipartite graphs
• Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
• Bipartite Analogues of Comparability and Cocomparability Graphs
• Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
• Recognizing interval bigraphs by forbidden patterns
• Adjacency matrices of probe interval graphs
• A random intersection digraph: indegree and outdegree distributions
• Interval k-graphs : recognition and forbidden obstructions
• New characterizations of proper interval bigraphs
• Forbidden substructure for interval digraphs/bigraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663338)