scientific article; zbMATH DE number 15164

zbMATH Open0745.05020MaRDI QIDQ3977503FDOQ3977503

Authors: Paul Vaderlind 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

• Title not available (Why is that?)
• On the acyclic choosability of graphs
• Interval edge coloring of a graph with forbidden colors
• An algebraic criterion for the choosability of graphs
• An upper bound on adaptable choosability of graphs
• Towards a solution of the Dinitz problem?
• The Dinitz problem solved for rectangles
• Some results on \((a:b)\)-choosability
• Title not available (Why is that?)

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)