823 search results - page 66 / 165 » Brick partitions of graphs |
167
click to vote
ARSCOM
2007
15 years 6 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
175
click to vote
CPC
2004
15 years 6 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
152
click to vote
DAM
2008
15 years 6 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
141
click to vote
DM
2008
15 years 6 months ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
144
click to vote
JGAA
2008
15 years 6 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...