32 search results - page 4 / 7 » Vertex Partitions by Connected Monochromatic k-Regular Graph... |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
DMTCS
2010
13 years 4 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
CLASSIFICATION
2008
13 years 7 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
GC
2006
Springer
13 years 7 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...