2503 search results - page 145 / 501 » A study of 3-arc graphs |
180
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
197
click to vote
DM
2000
15 years 6 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
107
click to vote
ENDM
2006
15 years 6 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
157
click to vote
SIAMCO
2008
15 years 6 months ago
2008
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
197
click to vote
CPC
2011
15 years 1 months ago
2011
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...