Sciweavers

53 search results - page 11 / 11
» Spectral Densest Subgraph and Independence Number of a Graph
Sort
View
DM
2002
186views more  DM 2002»
13 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
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
13 years 6 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 10 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...