Homomorphisms to powers of digraphs

DOI10.1016/S0012-365X(01)00073-5zbMath0994.05071OpenAlexW2015635736MaRDI QIDQ1349073

Richard C. Brewster, Pavol Hell

Publication date: 21 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00073-5

zbMATH Keywords

characterizationscircular chromatic numberpolynomial time algorithmmin-max theoremhomomorphisms of digraphsminimum power problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Resource-sharing systems and hypergraph colorings ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs ⋮ A connection between circular colorings and periodic schedules

This page was built for publication: Homomorphisms to powers of digraphs