The chromatic number of random intersection graphs (Q521763): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6705140 / rank
 
Normal rank
Property / zbMATH Keywords
 
random intersection graphs
Property / zbMATH Keywords: random intersection graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
chromatic number
Property / zbMATH Keywords: chromatic number / rank
 
Normal rank
Property / zbMATH Keywords
 
colouring algorithms
Property / zbMATH Keywords: colouring algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1955 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2585467485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component evolution in random intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random Intersection Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component Evolution in General Random Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Chromatic Index of Random Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Non-sparse Random Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of independent sets in random intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 13 July 2024

scientific article
Language Label Description Also known as
English
The chromatic number of random intersection graphs
scientific article

    Statements

    The chromatic number of random intersection graphs (English)
    0 references
    12 April 2017
    0 references
    random intersection graphs
    0 references
    chromatic number
    0 references
    colouring algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references