scientific article
From MaRDI portal
Publication:3745859
zbMath0607.05031MaRDI QIDQ3745859
Jan Kratochvíl, Petr Kučera, Miroslav Goljan
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
A special planar satisfiability problem and a consequence of its NP- completeness ⋮ Decidability of string graphs ⋮ Cops and robbers on intersection graphs ⋮ String graphs. II: Recognizing string graphs is NP-hard ⋮ On intersection representations of co-planar graphs ⋮ String graphs. I: The number of critical nonstring graphs is infinite ⋮ Proper colorability of segment intersection graphs ⋮ Splitting a graph into disjoint induced paths or cycles. ⋮ String graphs and incomparability graphs ⋮ Refining the hierarchies of classes of geometric intersection graphs ⋮ An algorithm for the maximum weight independent set problem on outerstring graphs ⋮ Thresholds for classes of intersection graphs ⋮ The max clique problem in classes of string-graphs ⋮ Subexponential-time algorithms for finding large induced sparse subgraphs
