A connection between circular colorings and periodic schedules
type: Item
instance of: scholarly article
title: A connection between circular colorings and periodic schedules
zbMATH Open document ID: 1198.05072
author: Hong-Gwa Yeh
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5572013
zbMATH Keywords: circular chromatic number
zbMATH Keywords: periodic scheduling
zbMATH Keywords: timed marked graph
zbMATH Keywords: edge-weighted graph
zbMATH Keywords: Minty's theorem
MaRDI profile type: Publication
full work available at URL: j.dam.2008.10.003
OpenAlex ID: W1992171528
cites work: The circular chromatic number of a digraph
cites work: Homomorphisms to powers of digraphs
cites work: Marked directed graphs
cites work: Q5284584
cites work: On (k,d)-colorings and fractional nowhere-zero flows
cites work: Acyclic graph coloring and the complexity of the star chromatic number
cites work: Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
cites work: A Theorem on n-Coloring the Points of a Linear Graph
cites work: Circular colorings of edge-weighted graphs
cites work: Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
cites work: Scheduling Parallel Computations
cites work: Star chromatic number
cites work: A method to obtain lower bounds for circular chromatic number
cites work: Resource-sharing system scheduling and circular chromatic number
cites work: Circular chromatic number: A survey
cites work: Q3424895
DOI: 10.1016/J.DAM.2008.10.003
description: scientific article; zbMATH DE number 5572013