scientific article; zbMATH DE number 811561
From MaRDI portal
Publication:4852554
zbMath0829.06002MaRDI QIDQ4852554
Vojtěch Rödl, Jaroslav Nešetřil
Publication date: 1 November 1995
Full work available at URL: https://eudml.org/doc/118755
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10)
Related Items
On the complexity of cover-incomparability graphs of posets ⋮ The number of dependent arcs in an acyclic orientation ⋮ $st$-Orientations with Few Transitive Edges ⋮ Semi-transitive orientations and word-representable graphs ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Cover-incomparability graphs of posets ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Independent arcs of acyclic orientations of complete \(r\)-partite graphs
