641 search results - page 34 / 129 » On Planar Quasi-Parity Graphs |
124
click to vote
JGT
2007
15 years 1 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
117
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
118
click to vote
DM
2002
15 years 1 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
126
click to vote
SIGAL
1990
15 years 6 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
320
click to vote
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...