Non-repeated cycle lengths and Sidon sequences (Q2130516): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11856-021-2222-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3209855320 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2007.12513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering non-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on graphs without repeated cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for B2-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum cycle-distributed graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11856-021-2222-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:24, 17 December 2024

scientific article
Language Label Description Also known as
English
Non-repeated cycle lengths and Sidon sequences
scientific article

    Statements

    Non-repeated cycle lengths and Sidon sequences (English)
    0 references
    0 references
    0 references
    25 April 2022
    0 references
    maximum number of edges
    0 references
    2-connected graph without repeated cycle lengths
    0 references

    Identifiers

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