Coloring Random Intersection Graphs and Complex Networks

DOI10.1137/050647153zbMath1215.05054OpenAlexW1999360769MaRDI QIDQ5189517

Anusch Taraz, Michael Behrisch, Michael Ueckerdt

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050647153

zbMATH Keywords

intersection graphrandom graphcoloringcomplex network

Mathematics Subject Classification ID

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

Related Items (11)

Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Efficiently covering complex networks with cliques of similar vertices ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ The chromatic number of random intersection graphs ⋮ Large cliques in sparse random intersection graphs ⋮ On the Chromatic Index of Random Uniform Hypergraphs

Uses Software

• COSMOS

This page was built for publication: Coloring Random Intersection Graphs and Complex Networks