The chromatic number of random intersection graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 986986 (Why is no real title available?)
- Cliques in random graphs
- Coloring Random Intersection Graphs and Complex Networks
- Colouring Non-sparse Random Intersection Graphs
- Component evolution in general random intersection graphs
- Component evolution in random intersection graphs
- Constructions of independent sets in random intersection graphs
- Equivalence of a random intersection graph and G (n ,p )
- On Random Intersection Graphs: The Subgraph Problem
- On colouring random graphs
- On the chromatic index of random uniform hypergraphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
- The chromatic number of random graphs
- The chromatic number of random graphs
Cited in
(7)- On Some Combinatorial Properties of Random Intersection Graphs
- Coloring Random Intersection Graphs and Complex Networks
- Selected Combinatorial Properties of Random Intersection Graphs
- Selected combinatorial problems through the prism of random intersection graphs models
- Colouring Non-sparse Random Intersection Graphs
- Isoperimetric numbers of randomly perturbed intersection graphs
- On the chromatic number of non-sparse random intersection graphs
This page was built for publication: The chromatic number of random intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521763)