Sciweavers

677 search results - page 69 / 136
» Bipartite roots of graphs
Sort
View
RSA
2008
125views more  RSA 2008»
13 years 10 months ago
The game chromatic number of random graphs
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Tom Bohman, Alan M. Frieze, Benny Sudakov
RSA
2011
126views more  RSA 2011»
13 years 6 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 11 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
DAM
2006
116views more  DAM 2006»
13 years 11 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
COCOON
2003
Springer
14 years 4 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim