The distant-2 chromatic number of random proximity and random geometric graphs (Q963353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Connectivity of random <i>k</i>-nearest-neighbour graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic and clique numbers of random scaled sector graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank

Latest revision as of 17:31, 2 July 2024

scientific article
Language Label Description Also known as
English
The distant-2 chromatic number of random proximity and random geometric graphs
scientific article

    Statements

    The distant-2 chromatic number of random proximity and random geometric graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2010
    0 references
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references
    random graphs
    0 references
    coloring
    0 references
    distant-2 coloring
    0 references
    0 references