Eulerian straight ahead cycles in drawings of complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
Straight-ahead walks in Eulerian graphs
A straight ahead walk in an embedded Eulerian graph G always passes from an edge to the opposite edge in the rotation at the same vertex A straight ahead walk is called Eulerian if all the edges of the embedded graph G are traversed in this way starting from an arbitrary edge An embedding that contains an Eulerian straight ahead walk is called an Eulerian embedding In this article we characteri...
متن کاملBook drawings of complete bipartite graphs
4 We recall that a book with k pages consists of a straight line (the spine) and k half5 planes (the pages), such that the boundary of each page is the spine. If a graph is drawn 6 on a book with k pages in such a way that the vertices lie on the spine, and each edge 7 is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). 8 The pagenumber of a graph G is the ...
متن کاملTopological Drawings of Complete Bipartite Graphs
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been studied extensively in the context of crossing number problems. We consider a natural class of simple topological drawings of complete bipartite graphs, in ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملLinks inside Straight-Edge Embeddings of Complete Bipartite Graphs
We prove the following theorem. Let L be any link. There is some N = NL such that every straight-edge embedding of the complete bipartite graph KN,N contains a finite union of cycles having link type L. This result builds on the ideas of S. Negami, who proved the analogous result for complete graphs. Most of our motivation for this paper is to give a simpler proof of Negami’s Theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00068-6