3204 search results - page 125 / 641 » The b-chromatic Number of a Graph |
JGT
2007
13 years 10 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
JGT
2010
13 years 8 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
INFOVIS
2005
IEEE
14 years 3 months ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
DCOSS
2008
Springer
13 years 12 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
DM
2008
13 years 10 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....