Permutation bigraphs and interval containments
From MaRDI portal
(Redirected from Publication:401140)
Recommendations
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Characterizations for unit interval bigraphs
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
- scientific article; zbMATH DE number 1743762
- Recognizing interval digraphs and interval bigraphs in polynomial time
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 861315 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Bandwidth of bipartite permutation graphs in polynomial time
- Bandwidth of chain graphs
- Bipartite permutation graphs
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Circular-arc graphs with clique cover number two
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Containment Graphs, Posets, and Related Classes of Graphs
- Efficient graph representations
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Graph Classes: A Survey
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval bigraphs and circular arc graphs
- Interval digraphs: An analogue of interval graphs
- Labeling bipartite permutation graphs with a condition at distance two
- Modular decomposition and transitive orientation
- On the Ferrers dimension of a digraph
- Partially Ordered Sets
- Permutation Graphs and Transitive Graphs
- Random generation and enumeration of bipartite permutation graphs
- Representing digraphs using intervals or circular arcs
- Short proofs for interval digraphs
- The recognition of indifference digraphs and generalized semiorders
- Treewidth and minimum fill-in on permutation graphs in linear time
Cited in
(10)- Ferrers dimension of grid intersection graphs
- Biclique graphs of interval containment gigraphs
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- scientific article; zbMATH DE number 4063148 (Why is no real title available?)
- Forbidden substructure for interval digraphs/bigraphs
- Recognizing interval bigraphs by forbidden patterns
- Canonical antichains of unit interval and bipartite permutation graphs
- scientific article; zbMATH DE number 6928921 (Why is no real title available?)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Bipartite Analogues of Comparability and Cocomparability Graphs
This page was built for publication: Permutation bigraphs and interval containments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401140)
