Greedy \(T\)-colorings of graphs
type: Item
instance of: scholarly article
title: Greedy \(T\)-colorings of graphs
zbMATH Open document ID: 1213.05089
author: R. Janczewski
published in: Discrete Mathematics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5565706
zbMATH Keywords: \(T\)-coloring
zbMATH Keywords: \(T\)-span
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.049
OpenAlex ID: W2041534430
cites work: Frequency planning and ramifications of coloring
cites work: Q4940090
cites work: The complexity of the \(T\)-coloring problem for graphs with small degree
cites work: A polynomial algorithm for finding \(T\)-span of generalized cacti
cites work: A rainbow about \(T\)-colorings for complete graphs
cites work: \(T\)-graphs and the channel assignment problem
cites work: \(T\)-colorings of graphs: recent results and open problems
DOI: 10.1016/J.DISC.2008.01.049
description: scientific article; zbMATH DE number 5565706