Sciweavers

3204 search results - page 240 / 641
» The Alcuin Number of a Graph
Sort
View
DM
2002
186views more  DM 2002»
15 years 6 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
181
Voted
ALT
2010
Springer
15 years 1 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
RSA
2011
92views more  RSA 2011»
15 years 1 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
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...
Wesley Pegden
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Path-Based Supports for Hypergraphs
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...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...
SIAMDM
2010
167views more  SIAMDM 2010»
15 years 1 months ago
Domination Game and an Imagination Strategy
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...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall