On the chromatic number of non-sparse random intersection graphs
From MaRDI portal
Publication:519889
DOI10.1007/S00224-016-9733-XzbMath1358.05116OpenAlexW2559993039MaRDI QIDQ519889
Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
Publication date: 31 March 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9733-x
Cites Work
- Unnamed Item
- On the isolated vertices and connectivity in random intersection graphs
- On the independence number and Hamiltonicity of uniform random intersection graphs
- Sharp thresholds for Hamiltonicity in random intersection graphs
- Maximum cliques in graphs with small intersection number and random intersection graphs
- On the independence number of random graphs
- Large independent sets in general random intersection graphs
- Expander properties and the cover time of random intersection graphs
- A still better performance guarantee for approximate graph coloring
- Contention-free MAC protocols for asynchronous wireless sensor networks
- Secure communication over radio channels
- Equivalence of a random intersection graph and G (n ,p )
- Colouring Non-sparse Random Intersection Graphs
- The cover time of sparse random graphs
- On Random Intersection Graphs: The Subgraph Problem
- The vertex degree distribution of random intersection graphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Coloring Random Intersection Graphs and Complex Networks
- Secret Swarm Unit Reactive k −Secret Sharing
- Algorithms and Computation
- The chromatic number of random graphs
- The chromatic number of random graphs
- On a combinatorial game
- Graph colouring and the probabilistic method
This page was built for publication: On the chromatic number of non-sparse random intersection graphs
