scientific article
From MaRDI portal
Publication:3359787
zbMath0733.68064MaRDI QIDQ3359787
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Expected complexity of graph partitioning problems ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ Lower bounds on the chromatic number of random graphs ⋮ The t-improper chromatic number of random graphs ⋮ Coloring k-colorable graphs in constant expected parallel time ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ On the chromatic number of random graphs
This page was built for publication:
