Pages that link to "Item:Q5367021"
From MaRDI portal
The following pages link to Intersection-Link Representations of Graphs (Q5367021):
Displaying 22 items.
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Modular intersection graphs (Q1923781) (← links)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- A user study on hybrid graph visualizations (Q2151426) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- ChordLink: a new hybrid visualization model (Q2206859) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Directed Intersection Representations and the Information Content of Digraphs (Q5151714) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Hyperideal-based intersection graphs (Q6099744) (← links)
- The Computational Complexity of the ChordLink Model (Q6181950) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
