Results 1  10
of
11
Planarizing Graphs  A Survey and Annotated Bibliography
, 1999
"... Given a finite, undirected, simple graph G, we are concerned with operations on G that transform it into a planar graph. We give a survey of results about such operations and related graph parameters. While there are many algorithmic results about planarization through edge deletion, the results abo ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
Given a finite, undirected, simple graph G, we are concerned with operations on G that transform it into a planar graph. We give a survey of results about such operations and related graph parameters. While there are many algorithmic results about planarization through edge deletion, the results about vertex splitting, thickness, and crossing number are mostly of a structural nature. We also include a brief section on vertex deletion. We do not consider parallel algorithms, nor do we deal with online algorithms.
Locally finite graphs with ends: a topological approach
"... This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. Thi ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. This approach has made it possible to extend to locally finite graphs many classical theorems of finite graph theory that do not extend verbatim. The shift of paradigm it proposes is thus as much an answer to old questions as a source of new ones; many concrete problems of both types are suggested in the paper. This paper attempts to provide an entry point to this field for readers that have not followed the literature that has emerged in the last 10 years or so. It takes them on a quick route through what appear to be the most important lasting results, introduces them to key proof techniques, identifies the most promising open
Another characterisation of planar graphs
"... A new characterisation of planar graphs is presented. It concerns the structure of the cocycle space of a graph, and is motivated by consideration of the dual of an elementary property enjoyed by sets of circuits in any graph. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A new characterisation of planar graphs is presented. It concerns the structure of the cocycle space of a graph, and is motivated by consideration of the dual of an elementary property enjoyed by sets of circuits in any graph. 1
An algebraic characterization of projectiveplanar graphs
, 2002
"... We give a detailed algebraic characterization of when a graph G can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph G ∗ on the same edge set as G which satisfies algebraic conditions inspired by homology groups and intersection products in homol ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph G ∗ on the same edge set as G which satisfies algebraic conditions inspired by homology groups and intersection products in homology groups. 1
Algebraic characterizations of graph imbeddability in surfaces and pseudosurfaces
"... Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of faceconnected components, the number o ..."
Abstract
 Add to MetaCart
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of faceconnected components, the number of pinches, the number of crosscaps and handles, and the dimension of the first Z2homology group. The characterizations are formulated in terms of the existence of a dual graph G ∗ on the same set of edges as G which satisfies algebraic conditions inspired by homology groups and their intersection products. 1