4201 search results - page 62 / 841 » Interaction graphs: Additives |
134
Voted
ALGORITHMICA
2007
15 years 4 months ago
2007
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
132
click to vote
DAM
2008
15 years 4 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
146
click to vote
JGT
2007
15 years 3 months ago
2007
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
127
click to vote
SIAMDM
2000
15 years 3 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
128
click to vote
AGTIVE
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, the two types of UML interaction diagrams are considered. A translation of sequence diagrams into collaboration diagrams is constructed by means of graph transformat...