Sciweavers

3211 search results - page 30 / 643
» On the Grundy Number of a Graph
Sort
View
DM
2006
85views more  DM 2006»
13 years 7 months ago
Further analysis of the number of spanning trees in circulant graphs
Let 1 s1 < s2 <
Talip Atajan, Xuerong Yong, Hiroshi Inaba
DM
2000
99views more  DM 2000»
13 years 7 months ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
IPL
2008
68views more  IPL 2008»
13 years 7 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
CPC
2007
105views more  CPC 2007»
13 years 7 months ago
Packing Cliques in Graphs with Independence Number 2
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
Raphael Yuster