On the choosability of some graphs

MaRDI QIDQ2799864zbMATH OpenFDO

Authors Benkam Bobga, Julian A. Allagan, P. D. jun. Johnson

Publication date 13 April 2016

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

choice numberchromatic numberMycielski graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On chromatic‐choosable graphs
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• Chromatic choosability of a class of complete multipartite graphs
• Ohba's conjecture is true for graphs with independence number at most three
• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)

Cited in

(18)

• An upper bound on adaptable choosability of graphs
• Choice numbers of multi-bridge graphs
• On generalized choice and coloring numbers
• Choosability of planar graphs
• Choosability and paintability of the lexicographic product of graphs
• Incidence choosability of graphs
• An algebraic criterion for the choosability of graphs
• On choosability of some complete multipartite graphs and Ohba's conjecture
• On Non 3-Choosable Bipartite Graphs
• scientific article; zbMATH DE number 6383834 (Why is no real title available?)
• scientific article; zbMATH DE number 5850546 (Why is no real title available?)
• scientific article; zbMATH DE number 5963789 (Why is no real title available?)
• On chromatic‐choosable graphs
• On improperly chromatic-choosable graphs
• Every graph is (2,3)-choosable
• On the acyclic choosability of graphs
• scientific article; zbMATH DE number 7055496 (Why is no real title available?)
• Chromatic-choosability of hypergraphs with high chromatic number

This page was built for publication: On the choosability of some graphs

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