The chromatic and clique numbers of random scaled sector graphs
From MaRDI portal
Publication:817771
DOI10.1016/J.TCS.2005.09.050zbMath1085.05028OpenAlexW1964080736MaRDI QIDQ817771
Vishal Sanwalani, Maria J. Serna, Josep Diaz, Paul G. Spirakis
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.050
Random graphs (graph-theoretic aspects) (05C80) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ The distant-2 chromatic number of random proximity and random geometric graphs ⋮ Towards a dynamical model for wireless sensor networks
Cites Work
This page was built for publication: The chromatic and clique numbers of random scaled sector graphs
