Recognizing IC-Planar and NIC-Planar Graphs

DOI10.7155/jgaa.00466zbMath1388.05044arXiv1610.08884OpenAlexW2964181874WikidataQ129869104 ScholiaQ129869104MaRDI QIDQ4566013

Franz-Josef Brandenburg

Publication date: 14 June 2018

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.08884

zbMATH Keywords

IC-planar drawings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Recognizing and embedding simple optimal 2-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ Unnamed Item ⋮ Characterizing and recognizing 4-map graphs ⋮ Unnamed Item ⋮ IC-Planar Graphs Are 6-Choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• Recognizing and drawing IC-planar graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• A linear-time algorithm for testing outer-1-planarity
• Recognizing optimal 1-planar graphs in linear time
• The structure of plane graphs with independent crossings and its applications to coloring problems
• Density of straight-line 1-planar graph drawings
• Right angle crossing graphs and 1-planarity
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• \(\mathsf{NIC}\)-planar graphs
• Algorithms for graphs embeddable with few crossings per edge
• Recognizing hole-free 4-map graphs in cubic time
• Parameterized Complexity of 1-Planarity
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Coloring plane graphs with independent crossings
• Map graphs
• Über 1-optimale Graphen
• Chromatic number, independence ratio, and crossing number
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Arboricity and Subgraph Listing Algorithms
• Zur Struktur 1‐planarer Graphen
• Rectilinear drawings of graphs
• On the Density of Maximal 1-Planar Graphs
• 1-Planarity of Graphs with a Rotation System
• Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
• Enumeration of simple complete topological graphs
• Drawing graphs. Methods and models

This page was built for publication: Recognizing IC-Planar and NIC-Planar Graphs