Pages that link to "Item:Q476425"
From MaRDI portal
The following pages link to Approximation algorithms for intersection graphs (Q476425):
Displaying 14 items.
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs (Q510581) (← links)
- \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
- Generalized disk graphs (Q832849) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Hadwiger’s Conjecture and Squares of Chordal Graphs (Q2817883) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)