Sciweavers

7 search results - page 2 / 2
» Decomposing plane cubic graphs
Sort
View
CPC
2007
88views more  CPC 2007»
13 years 4 months ago
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
Bill Jackson
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
13 years 10 months ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset