17 search results - page 1 / 4 » On Paths in a Complete Bipartite Geometric Graph |
JCDCG
2000
Springer
13 years 9 months ago
2000
Springer
IPL
2007
13 years 5 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
GD
1998
Springer
13 years 10 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
GC
2011
Springer
13 years 1 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,...
DAM
2008
13 years 6 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...