Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants

MaRDI QIDQ2380445zbMATH OpenFDO

Authors Uwe Schauz

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/231503, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r13.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatoricAlon and Tarsi's theoremlist coloring and orientation of graphstime scheduling with unreliable participants

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43)

Recommendations

• Generalized list \(T\)-colorings of cycles
• Hypergraph extension of the Alon-Tarsi list coloring theorem
• The tournament scheduling problem with absences
• Brooks' theorem via the Alon-Tarsi theorem
• Chromatic scheduling

Cited in

(25)

• Toroidal graphs without \(K_5^-\) and 6-cycles
• Graph polynomials and paintability of plane graphs
• Application of polynomial method to on-line list colouring of graphs
• Locally planar graphs are 2-defective 4-paintable
• On-line list coloring of matroids
• Degeneracy and colorings of squares of planar graphs without 4-cycles
• Combinatorial Nullstellensatz and DP-coloring of graphs
• An infinite family of sum-paint critical graphs
• Beyond degree choosability
• Painting squares in \(\Delta^2-1\) shades
• Graph polynomials and group coloring of graphs
• Critically paintable, choosable or colorable graphs
• On two generalizations of the Alon-Tarsi polynomial method
• Choosability and paintability of the lexicographic product of graphs
• The tournament scheduling problem with absences
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• Brooks' theorem via the Alon-Tarsi theorem
• Paintability of complete bipartite graphs
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• Partial online list coloring of graphs
• Improved lower bounds on the number of edges in list critical and online list critical graphs
• The list-chromatic index of \(K_6\)
• Relation between the correspondence chromatic number and the Alon-Tarsi number
• On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
• Brooks' Theorem and Beyond

This page was built for publication: Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants

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