3471 search results - page 193 / 695 » Obstacle Numbers of Graphs |
157
click to vote
DM
2010
15 years 5 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
149
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
146
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
138
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
139
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...