The smallest graphs with certain adjacency properties (Q1145705): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127156126, #quickstatements; #temporary_batch_1722291251637
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smallest graph of girth 5 and valency 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest graph of girth 5 and valency 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smallest graph of girth 5 and valency 5 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90283-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991689454 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127156126 / rank
 
Normal rank

Latest revision as of 12:47, 30 July 2024

scientific article
Language Label Description Also known as
English
The smallest graphs with certain adjacency properties
scientific article

    Statements

    The smallest graphs with certain adjacency properties (English)
    0 references
    0 references
    0 references
    1980
    0 references
    smallest graph with property
    0 references

    Identifiers