Right angle crossing graphs and 1-planarity
type: Item
instance of: scholarly article
title: Right angle crossing graphs and 1-planarity
zbMATH Open document ID: 1408.05042
author: Peter Eades
author: Giuseppe Liotta
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6157659
zbMATH Keywords: RAC graphs
zbMATH Keywords: 1-planarity
zbMATH Keywords: geometric graph theory
Wikidata QID: Q59702327
MaRDI profile type: Publication
full work available at URL: j.dam.2012.11.019
OpenAlex ID: W2122778940
cites work: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
cites work: On the Perspectives Opened by Right Angle Crossing Drawings
cites work: Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
cites work: Geometric RAC Simultaneous Drawings of Graphs
cites work: Maximizing the Total Resolution of Graphs
cites work: The Straight-Line RAC Drawing Problem Is NP-Hard
cites work: Graphs that Admit Right Angle Crossing Drawings
cites work: Acyclic colouring of 1-planar graphs
cites work: On the Density of Maximal 1-Planar Graphs
cites work: 1-planarity of complete multipartite graphs
cites work: A characterization of complete bipartite RAC graphs
cites work: Drawing graphs with right angle crossings
cites work: The Crossing-Angle Resolution in Graph Drawing
cites work: Bounds on the crossing resolution of complete geometric graphs
cites work: 2-Layer Right Angle Crossing Drawings
cites work: Area, curve complexity, and crossing resolution of non-planar graph drawings
cites work: Notes on large angle crossing graphs
cites work: Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
cites work: Fáry’s Theorem for 1-Planar Graphs
cites work: The structure of 1-planar graphs
cites work: Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20--22, 2012. Proceedings
cites work: Graph drawing software
cites work: Drawing graphs. Methods and models
cites work: Minimal non-1-planar graphs
cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
cites work: Graphs drawn with few crossings per edge
cites work: Empirical evaluation of aesthetics-based graph layout
cites work: Optimal 1-planar graphs which triangulate other surfaces
cites work: Rectilinear drawings of graphs
cites work: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
DBLP publication ID: journals/dam/EadesL13
DOI: 10.1016/J.DAM.2012.11.019
Recommended article: Right Angle Crossing Graphs and 1-Planarity
Recommended article: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
Recommended article: Compact drawings of 1-planar graphs with right-angle crossings and few bends
Recommended article: Drawing Graphs with Right Angle Crossings
Recommended article: Graphs that Admit Right Angle Crossing Drawings
Recommended article: Graphs that admit right angle crossing drawings
Recommended article: The maximal 1-planarity and crossing numbers of graphs
Recommended article: Crossing Angles of Geometric Graphs
description: scientific article; zbMATH DE number 6157659