7913 search results - page 197 / 1583 » Information Collection on a Graph |
JGT
2006
13 years 10 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
CIE
2010
Springer
14 years 3 months ago
2010
Springer
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
DM
2008
13 years 10 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
LATIN
2010
Springer
14 years 5 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
ICANN
2007
Springer
14 years 4 months ago
2007
Springer
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...