Complete catalogue of graphs of maximum degree 3 and defect at most 4 (Q967350): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081884894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large graphs with given degree and diameter. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal cubic graphs with diameter 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198513 / 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: Diameters of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of certain cubic graphs with small diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3722534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moore graphs and beyond: a survey of the degree/diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank

Latest revision as of 19:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Complete catalogue of graphs of maximum degree 3 and defect at most 4
scientific article

    Statements

    Complete catalogue of graphs of maximum degree 3 and defect at most 4 (English)
    0 references
    28 April 2010
    0 references
    0 references
    degree problem
    0 references
    diameter problem
    0 references
    cubic graphs
    0 references
    Moore bound
    0 references
    Moore graphs
    0 references
    defect
    0 references
    0 references