3211 search results - page 99 / 643 » On the Grundy Number of a Graph |
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
JGT
2008
13 years 10 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
IPL
2000
13 years 10 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
ICIP
2007
IEEE
14 years 12 months ago
2007
IEEE
This paper proposes a stream authentication method based on the Generalized Butterfly Graph (GBG) framework. Compared with the original Butterfly graph, the proposed GBG graph sup...