GC
2008
Springer
13 years 4 months ago
2008
Springer
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...
GC
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
GC
2008
Springer
13 years 4 months ago
2008
Springer
GC
2008
Springer
13 years 4 months ago
2008
Springer
GC
2008
Springer
13 years 4 months ago
2008
Springer
GC
2008
Springer
13 years 4 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 4 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 4 months ago
2008
Springer
An n
GC
2008
Springer
13 years 4 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 4 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...