scientific article; zbMATH DE number 1153458

MaRDI QIDQ4388209zbMATH OpenFDO

Authors D. Hanson, Gary MacGillivray, Bjarne Toft

Publication date 17 May 1998

zbMATH Keywords

bipartite graphchoosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Publication:4504889
• On \((4,2)\)-choosable graphs
• On Non 3-Choosable Bipartite Graphs
• On the Choice Numbers of Some Complete Multipartite Graphs
• scientific article; zbMATH DE number 5963789

Cited in

(14)

• On the subspace choosability in graphs
• Incidence choosability of graphs
• On Non 3-Choosable Bipartite Graphs
• scientific article; zbMATH DE number 5850546 (Why is no real title available?)
• scientific article; zbMATH DE number 5963789 (Why is no real title available?)
• Coloring, sparseness and girth
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1506497 (Why is no real title available?)
• Amenable colorings
• Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
• Multiple list coloring of 3‐choice critical graphs
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
• The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)

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