Note on Enomoto and Ota's conjecture for short paths in large graphs (Q489313): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123139644, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hua Wang / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-013-1351-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024548810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of a graph into paths with prescribed endvertices and lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type Theorem for Perfect Packings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic version of a conjecture by Enomoto and Ota / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 12:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Note on Enomoto and Ota's conjecture for short paths in large graphs
scientific article

    Statements

    Note on Enomoto and Ota's conjecture for short paths in large graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2015
    0 references
    disjoint paths
    0 references
    degree sum
    0 references
    regularity lemma
    0 references

    Identifiers

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