4171 search results - page 63 / 835 » Choice numbers of graphs |
GD
2006
Springer
15 years 3 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
CCCG
1997
15 years 1 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
APPML
2005
14 years 11 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
107
click to vote
WALCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...