Homomorphisms to powers of digraphs

DOI10.1016/S0012-365X(01)00073-5MaRDI QIDQ1349073zbMATH OpenOpenAlexFDO

Authors 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 numberhomomorphisms of digraphsmin-max theoremminimum power problempolynomial time algorithm

Mathematics Subject Classification ID

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

Recommendations

• The Existence of Homomorphisms to Oriented Cycles
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• Homomorphisms to oriented paths
• Polynomial graph-colorings
• A Polynomial Algorithm for Homomorphisms to Oriented Cycles

Cited in

(7)

• A connection between circular colorings and periodic schedules
• On traceable powers of digraphs
• Resource-sharing systems and hypergraph colorings
• The Existence of Homomorphisms to Oriented Cycles
• A Polynomial Algorithm for Homomorphisms to Oriented Cycles
• Minimum Cost Homomorphisms to Reflexive Digraphs
• Homomorphisms, representations and characteristic polynomials of digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349073)