3471 search results - page 12 / 695 » Obstacle Numbers of Graphs |
146
click to vote
SOFSEM
2005
Springer
15 years 8 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...
220
click to vote
GC
2011
Springer
14 years 10 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,...
111
Voted
DAM
2008
15 years 3 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...
124
click to vote
JGT
2007
15 years 3 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...