829 search results - page 3 / 166 » Distance domination-critical graphs |
HPCC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
106
click to vote
RSA
2008
14 years 11 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
117
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
112
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...