Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.10.042 / rank
Normal rank
 
Property / author
 
Property / author: Stanley M. Selkow / rank
Normal rank
 
Property / author
 
Property / author: Stanley M. Selkow / 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.1016/j.disc.2007.10.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086330117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition: A new key to coding theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions without isolated vertices III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / 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: Proof of a Packing Conjecture of Bollobás / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242960 / 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: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Packing and Graph Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamiltonian cycles in Dirac graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2007.10.042 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:07, 10 December 2024

scientific article
Language Label Description Also known as
English
Distributing vertices along a Hamiltonian cycle in Dirac graphs
scientific article

    Statements

    Distributing vertices along a Hamiltonian cycle in Dirac graphs (English)
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    graph theory
    0 references
    Hamiltonian cycle
    0 references
    Dirac graph
    0 references
    distance
    0 references

    Identifiers