List colourings of graphs
From MaRDI portal
Recommendations
Cited in
(46)- A note on list improper coloring of plane graphs
- Ohba's conjecture is true for graphs with independence number at most three
- Entire choosability of near-outerplane graphs
- List-coloring graphs without \(K_{4,k}\)-minors
- Graphic and protographic lists of integers
- Partial list colorings
- On group choosability of graphs. II
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
- On \(t\)-common list-colorings
- List supermodular coloring
- On choosability of some complete multipartite graphs and Ohba's conjecture
- List coloring of Cartesian products of graphs
- Sum list coloring graphs
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- List-colourings
- A note on total and list edge-colouring of graphs of tree-width 3
- List Coloring with a Bounded Palette
- List hereditary colorings of graphs (extended abstract)
- scientific article; zbMATH DE number 6000769 (Why is no real title available?)
- Colouring graphs on surfaces
- Graph colorings with local constraints -- a survey
- Defective choosability of graphs with no edge-plus-independent-set minor
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- List coloring digraphs
- Orientations of graphs with prescribed weighted out-degrees
- A proof of a conjecture of Ohba
- Introduction to list colourings
- Coloring graphs from lists with bounded size of their union
- List colouring when the chromatic number is close to the order of the graph
- List-coloring embedded graphs
- On the complexity of some colorful problems parameterized by treewidth
- Biclique immersions in graphs with independence number 2
- On the choosability of \(H\)-minor-free graphs
- On two problems of defective choosability of graphs
- New counterexamples to a conjecture by Woodall on graph minors and list coloring
- Complete bipartite immersion in graphs with independence number two: a simple proof
- Limits of degeneracy for colouring graphs with forbidden minors
- Seymour and Woodall's conjecture holds for graphs with independence number two
- Biclique immersions in graphs with independence number 2 (extended abstract)
- Dense graphs have \(K_{3,t}\) minors
- Contractibility and the Hadwiger conjecture
- Partial list colouring of certain graphs
- List-colouring the square of a \(K_4\)-minor-free graph
- The average degree of a multigraph critical with respect to edge or total choosability
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
This page was built for publication: List colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741180)
