A lower bound for on-line ranking number of a path (Q878626): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2005.11.072 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982793783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line ranking number for cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimization on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line rankings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on on-line ranking number of graphs / rank
 
Normal rank

Latest revision as of 18:14, 25 June 2024

scientific article
Language Label Description Also known as
English
A lower bound for on-line ranking number of a path
scientific article

    Statements

    A lower bound for on-line ranking number of a path (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    ranking
    0 references
    ranking number
    0 references
    on-line ranking number
    0 references
    path
    0 references

    Identifiers