scientific article; zbMATH DE number 7088258
From MaRDI portal
Publication:5226839
zbMath1417.05040arXiv1710.07476MaRDI QIDQ5226839
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1710.07476
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Positive planar satisfiability problems under 3-connectivity constraints ⋮ Colourful components in \(k\)-caterpillars and planar graphs ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ On conflict-free spanning tree: algorithms and complexity ⋮ On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)
This page was built for publication:
