On the Crossing Number of Almost Planar Graphs. - Informatica

On the Crossing Number of Almost Planar Graphs.

By Informatica

  • Release Date - Published: 2006-10-01
  • Book Genre: Industries & Professions
  • Author: Informatica
Our rating: 5/5 stars

Score: (From 0 Ratings)

On the Crossing Number of Almost Planar Graphs. Informatica read online review & book description:

If G is a plane graph and x, y [member of] V (G), then the dual distance of x and y is equal to the minimum number of crossings of G with a closed curve in the plane joining x and y. Riskin [7] proved that if [G.sub.0] is a 3-connected cubic planar graph, and x, y are its vertices at dual distance d, then the crossing number of the graph [G.sub.0]) + xy is equal to d. Riskin asked if his result holds for arbitrary 3-connected planar graphs. In this paper it is proved that this is not the case (not even for every 5-connected planar graph [G.sub.0]). Povzetek: Analizirana je Riskinova teza o planarnih grafih.

@2019 – Go Read a Book. All Right Reserved. goreadabook.org is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for website owners, to earn advertising fees by linking and advertising to amazon.com and any other website that may be affiliated with Amazon Service LLC Associates Program; As an Amazon Associate I earn from qualifying purchases.

On the Crossing Number of Almost Planar Graphs. book review On the Crossing Number of Almost Planar Graphs. ePUB; Informatica; Industries & Professions books.

Post a review about this book