Sciweavers

641 search results - page 84 / 129
» On Planar Quasi-Parity Graphs
Sort
View
EJC
2007
14 years 12 months ago
Labeling planar graphs with a condition at distance two
Peter Bella, Daniel Král, Bojan Mohar, Kata...
JCT
2007
94views more  JCT 2007»
14 years 11 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
KIVS
2011
Springer
14 years 2 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay