Upper bounds on the non-3-colourability threshold of random graphs.

Slični predmeti

• Upper bounds on the non-3-colourability threshold of random graphs
  od: Nikolaos Fountoulakis, i dr.
  Izdano: (2002-01-01)
• Upper bounds on the non- 3-colourability threshold of random graphs
  od: Nikolaos Fountoulakis, i dr.
  Izdano: (2002-12-01)
• Colouring random geometric graphs
  od: Colin J. H. McDiarmid, i dr.
  Izdano: (2005-01-01)
• Clique colouring of binomial random graphs
  od: McDiarmid, C, i dr.
  Izdano: (2018)
• Largest sparse subgraphs of random graphs.
  od: Fountoulakis, N, i dr.
  Izdano: (2011)