On the complexity of the approximation of nonplanarity parameters for cubic graphs

Authors:
Luerbio Faria;Celina M. Herrera de Figueiredo;Candido F. X. Mendonça
Affiliations:
Faculdade de Formação de Professores, Universidade do Estado do, Rio de Janeiro, Brazil;Instituto de Matemática and COPPE, Universidade Federal do Rio de Janeiro, Brazil;Departamento de Informática, Universidade Estadual de Maring´, Brazil
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 3
Cited 3

A better approximation algorithm for finding planar subgraphs

Journal of Algorithms
Splitting number is NP-complete

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Graph Theory With Applications

Graph Theory With Applications

Large planar subgraphs in dense graphs

Journal of Combinatorial Theory Series B
On maximum planar induced subgraphs

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Planarization and acyclic colorings of subcubic claw-free graphs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G=(V,E) be a simple graph. The NON-PLANAR DELETION problem consists in finding a smallest subset E' ⊂ E such that H=(V,E\E') is a planar graph. The SPLITTING NUMBER problem consists in finding the smallest integer k ≥ 0, such that a planar graph H can be defined fromG by k vertex splitting operations. We establish the Max SNP-hardness of SPLITTING NUMBER and NON-PLANAR DELETION problems for cubic graphs.