Greedy rankings and arank numbers
type: Item
instance of: scholarly article
title: Greedy rankings and arank numbers
zbMATH Open document ID: 1197.05144
author: Garth Isaak
author: Robert E. Jamison
author: Darren Narayan
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5773806
zbMATH Keywords: graph algorithms
zbMATH Keywords: vertex coloring
zbMATH Keywords: on-line ranking number
zbMATH Keywords: rank number
zbMATH Keywords: minimal rankings
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.03.028
OpenAlex ID: W2062037518
cites work: On-line ranking number for cycles and paths
cites work: A lower bound for on-line ranking number of a path
cites work: On the equality of the grundy and ochromatic numbers of a graph
cites work: Minimal rankings
cites work: Optimal node ranking of trees
cites work: Q4470341
cites work: Q2931464
cites work: Minimal rankings and the arank number of a path
cites work: Oriented list colorings of graphs
DOI: 10.1016/J.IPL.2009.03.028
description: scientific article; zbMATH DE number 5773806