scientific article; zbMATH DE number 15164

MaRDI QIDQ3977503zbMATH OpenFDO

Authors Paul Vaderlind

Publication date 25 June 1992

zbMATH Keywords

choosabilityconjecture of Dinitz

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 3735847
• Towards a solution of the Dinitz problem?
• Some results on (a:b)-choosability
• List colourings of planar graphs
• The Dinitz problem solved for rectangles

Cited in

(9)

• An upper bound on adaptable choosability of graphs
• Some results on (a:b)-choosability
• Towards a solution of the Dinitz problem?
• Interval edge coloring of a graph with forbidden colors
• An algebraic criterion for the choosability of graphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• The Dinitz problem solved for rectangles
• On the acyclic choosability of graphs
• scientific article; zbMATH DE number 7055496 (Why is no real title available?)

This page was built for publication:

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