Sciweavers

1633 search results - page 68 / 327
» Planar Map Graphs
Sort
View
STACS
2010
Springer
14 years 5 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
JCT
2007
94views more  JCT 2007»
13 years 10 months ago
A zero-free interval for flow polynomials of cubic graphs
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 (−∞...
Bill Jackson
EJC
2011
13 years 5 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
TVCG
2008
140views more  TVCG 2008»
13 years 10 months ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...