New results on edge partitions of 1-plane graphs
DOI10.1016/j.tcs.2017.12.024zbMath1386.68117arXiv1706.05161OpenAlexW2626630915WikidataQ62042372 ScholiaQ62042372MaRDI QIDQ1694686
William S. Evans, Fabrizio Montecchiani, Giuseppe Liotta, Stephen K. Wismath, Walter Didimo, Emilio Di Giacomo, Henk G. Meijer
Publication date: 6 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.05161
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- On drawings and decompositions of 1-planar graphs
- A note on 1-planar graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- On partitioning the edges of 1-plane graphs
- Ortho-polygon visibility representations of embedded graphs
- L-visibility drawings of IC-planar graphs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Surfaces, tree-width, clique-minors, and partitions
- Outerplanar partitions of planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- An annotated bibliography on 1-planarity
- Graphs with forbidden subgraphs
- Re-embeddings of Maximum 1-Planar Graphs
- Coloring plane graphs with independent crossings
- Edge partition of planar sraphs into two outerplanar graphs
This page was built for publication: New results on edge partitions of 1-plane graphs
