scientific article; zbMATH DE number 6472574
From MaRDI portal
Publication:5501778
Cited in
(29)- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- Localized and compact data-structure for comparability graphs
- Enumeration aspects of maximal cliques and bicliques
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- Even and odd pairs in comparability and in P₄-comparability graphs
- A note on transitive orientations with maximum sets of sources and sinks
- On the \(P_4\)-components of graphs
- NP-completeness results for edge modification problems
- Linear-time algorithms for maximum sets of sources and sinks
- The complexity of the partial order dimension problem: closing the gap
- Distance Labeling for Permutation Graphs
- scientific article; zbMATH DE number 1420489 (Why is no real title available?)
- Line-distortion, bandwidth and path-length of a graph
- Easily testable graph properties
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- Recognizing \(k\)-clique extendible orderings
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- The complexity of embedding orders into small products of chains
- Comparability graphs among cover-incomparability graphs
- Dominance drawings for DAGs with bounded modular width
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Drawing Order Diagrams Through Two-Dimension Extension
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Gallai-like characterization of strong cocomparability graphs
- A fixed-parameter algorithm for dominance drawings of DAGs
- The stochastic 2-binary choice problem
- The complexity of transitively orienting temporal graphs
- Generalising the maximum independent set algorithm via Boolean networks
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
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 Q5501778)