3204 search results - page 3 / 641 » The Alcuin Number of a Graph |
125
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
136
Voted
SOFSEM
2005
Springer
15 years 7 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...
204
click to vote
GC
2011
Springer
14 years 8 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,...
JGT
2011
14 years 8 months ago
2011
118
click to vote
GC
2010
Springer
15 years 9 days ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...