540 search results - page 20 / 108 » New bounds on the edge number of a k-map graph |
AI
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
121
click to vote
COMBINATORICA
2010
14 years 6 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
EJC
2007
14 years 11 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
MVA
1990
15 years 1 months ago
1990
This paper proposes a novel representation of the free space of mobile robot by distinct, non-overlapping regions called Edge Visibility Regions (EVRs). An algorithm to partition ...
SIAMDM
2008
14 years 11 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...