1395 search results - page 102 / 279 » (k, )-Distance-Hereditary Graphs |
DCG
2008
14 years 10 months ago
2008
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
86
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
JCO
2007
14 years 9 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
CIAC
1997
Springer
15 years 2 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...