Oriented list colorings of graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200104)36:4<217::AID-JGT1007>3.0.CO;2-1" /><217::AID-JGT1007>3.0.CO;2-1 10.1002/1097-0118(200104)36:4<217::AID-JGT1007>3.0.CO;2-1zbMath0991.05046OpenAlexW4234719289MaRDI QIDQ2725322

Zsolt Tuza, Margit Voigt

Publication date: 28 August 2002

Full work available at URL: https://doi.org/10.1002/1097-0118(200104)36:4<217::aid-jgt1007>3.0.co;2-1

zbMATH Keywords

oriented choice numberoriented list colorings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Problems and results in extremal combinatorics. II ⋮ Greedy rankings and arank numbers ⋮ Chromatic polynomials of oriented graphs

Cites Work

• Unnamed Item
• Some extremal results in cochromatic and dichromatic theory
• Graph colorings with local constraints -- a survey
• The chromatic number of oriented graphs

This page was built for publication: Oriented list colorings of graphs