MSOL restricted contractibility to planar graphs
DOI10.1016/J.TCS.2017.02.030zbMATH Open1370.68113OpenAlexW2594929095WikidataQ62048074 ScholiaQ62048074MaRDI QIDQ527397FDOQ527397
Authors: James Abello, Pavel Klavík, Jan Kratochvíl, Tomáš Vyskočil 
Publication date: 11 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.030
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Graph minors. XIII: The disjoint paths problem
- Graphs on surfaces
- Efficient Planarity Testing
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- Crossing Number is NP-Complete
- Computing crossing numbers in quadratic time
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
- The complexity of induced minors and related problems
- Obtaining planarity by contracting few edges
- On graph contractions and induced minors
- Obtaining a Bipartite Graph by Contracting Few Edges
- Title not available (Why is that?)
- A simpler proof of the excluded minor theorem for higher surfaces
- Obtaining a Planar Graph by Vertex Deletion
- Title not available (Why is that?)
- MSOL Restricted Contractibility to Planar Graphs
This page was built for publication: MSOL restricted contractibility to planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527397)
