1952 search results - page 211 / 391 » Complete partitions of graphs |
167
click to vote
EJC
2008
15 years 6 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
177
click to vote
WG
1994
Springer
15 years 10 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
182
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
194
click to vote
SIROCCO
2007
15 years 8 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
198
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...