Locating any two vertices on Hamiltonian cycles in large graphs (Q776260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2020.111941 / rank
Normal rank
 
Property / author
 
Property / author: Wei-Hua He / rank
Normal rank
 
Property / author
 
Property / author: Wei-Hua He / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2741998008 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.00231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles with all small even chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on locating pairs of vertices on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating pairs of vertices on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on the Hamiltonian problem: survey III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributing pairs of vertices on Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Hamiltonian cycle in which specified vertices are uniformly distributed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles, Minimum Degree, and Bipartite Holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributing vertices along a Hamiltonian cycle in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2020.111941 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:18, 10 December 2024

scientific article
Language Label Description Also known as
English
Locating any two vertices on Hamiltonian cycles in large graphs
scientific article

    Statements

    Identifiers