Greedy rankings and arank numbers (Q989495): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On-line ranking number for cycles and paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for on-line ranking number of a path / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the equality of the grundy and ochromatic numbers of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal rankings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal node ranking of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4470341 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2931464 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal rankings and the arank number of a path / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Oriented list colorings of graphs / rank | |||
Normal rank |
Latest revision as of 03:20, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedy rankings and arank numbers |
scientific article |
Statements
Greedy rankings and arank numbers (English)
0 references
20 August 2010
0 references
graph algorithms
0 references
vertex coloring
0 references
on-line ranking number
0 references
rank number
0 references
minimal rankings
0 references