Sciweavers

617 search results - page 16 / 124
» On the Chromatic Number of Random Graphs
Sort
View
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 6 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul
CMA
2010
73views more  CMA 2010»
13 years 5 months ago
On the chromatic number of integral circulant graphs
Aleksandar Ilic, Milan Basic
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
13 years 7 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
IPL
2008
169views more  IPL 2008»
13 years 7 months ago
Oriented colorings of partial 2-trees
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
Pascal Ochem, Alexandre Pinlou