3757 search results - page 176 / 752 » The overlap number of a graph |
163
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
199
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
151
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
184
click to vote
JCT
2007
15 years 6 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
151
click to vote
ORL
2007
15 years 6 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...