DAM
2002
13 years 4 months ago
2002
The coupled graph c(G) of a plane graph G is the graph de
DAM
2002
13 years 4 months ago
2002
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...
DAM
2002
13 years 4 months ago
2002
In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on t...
DAM
2002
13 years 4 months ago
2002
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...
DAM
2002
13 years 4 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
DAM
2002
13 years 4 months ago
2002
DAM
2002
13 years 4 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
DAM
2002
13 years 4 months ago
2002
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
DAM
2002
13 years 4 months ago
2002
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
DAM
2002
13 years 4 months ago
2002