We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...