1952 search results - page 110 / 391 » Complete partitions of graphs |
118
click to vote
ENDM
2002
15 years 4 months ago
2002
Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a...
169
click to vote
TGC
2010
Springer
15 years 2 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
125
click to vote
DAM
2008
15 years 4 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...
119
click to vote
DM
2008
15 years 4 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...
122
click to vote
JGAA
2008
15 years 4 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...