Bipartite coverings and the chromatic number.
Mubayi, Dhruv, Vishwanathan, Sundar (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Approximations of weighted independent set and hereditary subset problems.”
Bipartite coverings and the chromatic number.
Parallel algorithms on interval graphs
V. B. Balayogan, C. Pandu Rangan (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two heuristics for the absolute -center problem in graphs
Ján Plesník (1988)
Mathematica Slovaca
Similarity:
Fast approximation of centrality.
Eppstein, David, Wang, Joseph (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the cover time of planar graphs.
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
Similarity:
Approximation algorithms for some graph partitioning problems.
He, G., Liu, J., Zhao, C. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Guessing secrets.
Chung, Fan, Graham, Ronald, Leighton, Tom (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Threshold functions for the bipartite Turán property.
Godbole, Anant P., Lamorte, Ben, Sandquist, Erik Jonathan (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Induced trees in triangle-free graphs.
Matousek, Jirí, Sámal, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Cooper, Colin, Frieze, Alan (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity: