scientific article; zbMATH DE number 7055496

MaRDI QIDQ5741893zbMATH OpenFDO

Authors Marc Demange, Dominique De Werra

Publication date 16 May 2019

zbMATH Keywords

grid graphslist chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A refinement of choosability of graphs
• \(T\)-choosability in graphs
• scientific article; zbMATH DE number 15164
• Extensions of extremal graph theory to grids
• On the choosability of some graphs
• ON (k, t)-edge-choosability of graphs
• On (k,t)-choosability of graphs.
• On the total choosability of planar graphs and of sparse graphs
• (2,t)-choosable graphs
• An algebraic criterion for the choosability of graphs

Cited in

(1)

• On some coloring problems in grids

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 Q5741893)