677 search results - page 44 / 136 » Bipartite roots of graphs |
GD
1998
Springer
14 years 2 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
DM
2000
13 years 9 months ago
2000
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
DM
2010
13 years 10 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
CAGD
2007
13 years 9 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...