On the asymptotic growth of bipartite graceful permutations (Q1712524): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128848818, #quickstatements; #temporary_batch_1726365119168
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3469136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5401064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of graceful labellings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting graceful labelings of trees: a theoretical and empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular embeddings of complete graphs from graceful labellings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on 1‐Rotational Hamiltonian Cycle Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3099547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequenceable groups and related topics. / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128848818 / rank
 
Normal rank

Latest revision as of 02:56, 15 September 2024

scientific article
Language Label Description Also known as
English
On the asymptotic growth of bipartite graceful permutations
scientific article

    Statements

    On the asymptotic growth of bipartite graceful permutations (English)
    0 references
    0 references
    0 references
    22 January 2019
    0 references
    \(\alpha\)-labeling
    0 references
    graceful labeling
    0 references
    Hamiltonian decomposition
    0 references
    R-sequencing
    0 references
    triangular embedding
    0 references

    Identifiers