GC
2008
Springer
13 years 10 months ago
2008
Springer
GC
2008
Springer
13 years 10 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
GC
2008
Springer
13 years 10 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
GC
2008
Springer
13 years 10 months ago
2008
Springer
An n
GC
2008
Springer
13 years 10 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
GC
2008
Springer
13 years 10 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
GC
2008
Springer
13 years 10 months ago
2008
Springer
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM
