Colouring Semirandom Graphs
From MaRDI portal
Publication:5437231
DOI10.1017/S0963548306007917zbMath1137.05029MaRDI QIDQ5437231
Publication date: 18 January 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Constructing uniquely realizable graphs ⋮ Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery ⋮ On the tractability of coloring semirandom graphs
This page was built for publication: Colouring Semirandom Graphs
