1729 search results - page 28 / 346 » On Bounds for the k-Partitioning of Graphs |
132
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
WG
2009
Springer
15 years 8 months ago
2009
Springer
104
Voted
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
158
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
112
Voted
DM
2008
15 years 1 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...