3211 search results - page 121 / 643 » On the Grundy Number of a Graph |
RSA
2011
13 years 5 months ago
2011
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
IWOCA
2010
Springer
13 years 5 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
SIAMDM
2010
13 years 5 months ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
SODA
2012
ACM
12 years 19 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
APVIS
2008
13 years 11 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...