186 search results - page 6 / 38 » Exceptional planar polynomials |
JCT
2007
13 years 7 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
CAGD
2010
13 years 7 months ago
2010
Minkowski Pythagorean hodograph curves are polynomial curves with polynomial speed, measured with respect to Minkowski norm. Curves of this special class are particularly well sui...
HYBRID
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
CCCG
2007
13 years 9 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...