The chromatic number of random intersection graphs

DOI10.7151/DMGT.1955zbMath1359.05045OpenAlexW2585467485MaRDI QIDQ521763

Katarzyna Rybarczyk

Publication date: 12 April 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1955

zbMATH Keywords

chromatic numberrandom intersection graphscolouring algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Isoperimetric numbers of randomly perturbed intersection graphs

Cites Work

• Unnamed Item
• Component evolution in random intersection graphs
• Constructions of independent sets in random intersection graphs
• Equivalence of a random intersection graph and G (n ,p )
• Colouring Non-sparse Random Intersection Graphs
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
• On colouring random graphs
• Cliques in random graphs
• On Random Intersection Graphs: The Subgraph Problem
• 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
• On the Chromatic Index of Random Uniform Hypergraphs
• Component Evolution in General Random Intersection Graphs
• The chromatic number of random graphs
• The chromatic number of random graphs

This page was built for publication: The chromatic number of random intersection graphs