Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
From MaRDI portal
Publication:5141643
DOI10.7155/jgaa.00531zbMath1451.05055OpenAlexW3020912769MaRDI QIDQ5141643
No author found.
Publication date: 18 December 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00531
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Improved enumeration of simple topological graphs
- 1-planarity of complete multipartite graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Simple realizability of complete abstract topological graphs in P
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- How many ways can one draw a graph?
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Visibility representations of boxes in 2.5 dimensions
- On fan-crossing and fan-crossing free graphs
- 1-fan-bundle-planar drawings of graphs
- On the planar split thickness of graphs
- Gap-planar graphs
- The splitting number of the complete graph
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Right angle crossing graphs and 1-planarity
- On topological graphs with at most four crossings per edge
- On fan-crossing graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- An Alternative Method to Crossing Minimization on Hierarchical Graphs
- The Crossing-Angle Resolution in Graph Drawing
- On the Number of Edges of Fan-Crossing Free Graphs
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- Chromatic number, independence ratio, and crossing number
- Crossing-Free Subgraphs
- A Visibility Representation for Graphs in Three Dimensions
- On the size of planarly connected crossing graphs
- A First Order Logic Definition of Beyond-Planar Graphs
- Graph Drawing
- Progress on Partial Edge Drawings
- On a problem of P. Turan concerning graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
