K-CROSSING CRITICAL ALMOST PLANAR GRAPHS
ABSTRACT: A graph is a pair of
a non-empty set of vertices and a set of edges. Graphs can be drawn on the plane
with or without crossing of its edges. Crossing number of a graph is the
minimal number of crossing among all
drawings of the
graph on the
plane. Graphs with
crossing number zero
are called planar. A graph is crossing critical if deleting any of its
edge decreases its crossing number. A graph is called almost planar if deleting
one edge makes the graph planar. This research shows graphs, given an integer k
≥ 1, to build an infinite family of crossing critical almost planar graphs having
crossing number k.
Author: Juwitha Rawung, Benny
Pinontoan, Winsy Weku
Journal Code: jpbiologigg130002
