The chromatic number of random intersection graphs
type: Item
instance of: scholarly article
title: The chromatic number of random intersection graphs
zbMATH Open document ID: 1359.05045
author: Katarzyna Rybarczyk
publication date: 2017-04-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6705140
zbMATH Keywords: random intersection graphs
zbMATH Keywords: chromatic number
zbMATH Keywords: colouring algorithms
MaRDI profile type: Publication
full work available at URL: dmgt.1955
OpenAlex ID: W2585467485
cites work: Component evolution in random intersection graphs
cites work: Coloring Random Intersection Graphs and Complex Networks
cites work: Component Evolution in General Random Intersection Graphs
cites work: The chromatic number of random graphs
cites work: Cliques in random graphs
cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
cites work: Q3122905
cites work: On colouring random graphs
cites work: On Random Intersection Graphs: The Subgraph Problem
cites work: On the Chromatic Index of Random Uniform Hypergraphs
cites work: Colouring Non-sparse Random Intersection Graphs
cites work: Equivalence of a random intersection graph and G (n ,p )
cites work: Constructions of independent sets in random intersection graphs
cites work: Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
DOI: 10.7151/DMGT.1955
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6705140