4171 search results - page 12 / 835 » Choice numbers of graphs |
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
100
click to vote
SOFSEM
2005
Springer
15 years 3 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
159
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
COMBINATORICS
2002
14 years 9 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
DAM
2008
14 years 10 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...