Two notions of unit distance graphs (Q2451892): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with large chromatic number and arbitrary girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the distance Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on induced subgraphs of the unit distance graph \(E^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension to represent a graph by a unit distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of zero-patterns of a sequence of polynomials / rank
 
Normal rank

Revision as of 12:58, 8 July 2024

scientific article
Language Label Description Also known as
English
Two notions of unit distance graphs
scientific article

    Statements

    Identifiers

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