1736 search results - page 56 / 348 » On antimagic directed graphs |
133
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
139
click to vote
JCT
2007
15 years 6 months ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...
155
click to vote
TCS
2008
15 years 6 months ago
2008
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
127
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
173
click to vote
GD
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...