The following pages link to (Q5501778):
Displayed 24 items.
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two (Q1023063) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- (Q2741377) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- (Q4944739) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- (Q5708487) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Comparability graphs among cover-incomparability graphs (Q6102263) (← links)
- Dominance drawings for DAGs with bounded modular width (Q6169511) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Drawing Order Diagrams Through Two-Dimension Extension (Q6181952) (← links)