Search Sciweavers | Sciweavers

60 search results - page 2 / 12

» On embeddability and stresses of graphs

click to vote

CPC
2007

112views more CPC 2007»

Graphs with Large Girth Not Embeddable in the Sphere

13 years 8 months ago

Download www.liafa.jussieu.fr

In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...

Pierre Charbit, Stéphan Thomassé

claim paper

Read More »

click to vote

JGAA
2006

108views more JGAA 2006»

Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

13 years 8 months ago

Download jgaa.info

Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...

Sergio Cabello

claim paper

Read More »

click to vote

FCT
2005
Springer

96views Applied Computing» more FCT 2005»

Algorithms for Graphs Embeddable with Few Crossings Per Edge

14 years 1 months ago

Download www.cs.uu.nl

Alexander Grigoriev, Hans L. Bodlaender

claim paper

Read More »