THE BULLETIN OF NATIONAL INSTITUTE of TECHNOLOGY, KISARAZU COLLEGE
Online ISSN : 2188-921X
Print ISSN : 2188-9201
ISSN-L : 0285-7901
The Straight Line Plane Graph (I)
Satoshi YAMASHITA
Author information
RESEARCH REPORT / TECHNICAL REPORT FREE ACCESS

2005 Volume 38 Pages 107-110

Details
Abstract
Graphs are the figures which have some points (called vertices) and some curves (called edges) with two vertices as endpoints. Planar graphs are graphs which are able to be drawn on the plane without selfcrossings. The graphs drawn in this way are called plane graphs. The plane graphs whose edges are all straight line segments are said straight line plane graphs. Two plane graphs are ambient isotopic if one can be transformed into the other in the plane without selfcrossings. In 1948 I.Fary proved that every plane graph is ambient isotopic to a straight line plane graph. This theorem is called Fary's theorem. We consider the problem that if some edge-disjoint paths of a plane graph are given, then how conditions are satisfied that the plane graph is ambient isotopic to a straight line plane graph such that these paths are straight line segments. In this paper, we give the necessary conditions that the plane graph is ambient isotopic to a straight line plane graph like this.
Content from these authors
© 2005 National Institute of Technology, Kisarazu College
Previous article Next article
feedback
Top