List-colourings of graphs
From MaRDI portal
Publication:1084403
DOI10.1007/BF02582936zbMATH Open0606.05027OpenAlexW2019973212MaRDI QIDQ1084403FDOQ1084403
Authors: Béla Bollobás, A. J. Harris 
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582936
Recommendations
total chromatic numberchromatic number of hypergraphconjecture of Albertson and Tuckeredge list-chromatic number
Cites Work
Cited In (73)
- List colorings of multipartite hypergraphs
- List Ramsey numbers
- Chromatic λ‐choosable and λ‐paintable graphs
- A brief history of edge-colorings -- with personal reminiscences
- Colouring problems for symmetric configurations with block size 3
- Edge-colouring graphs with local list sizes
- Asymptotically good local list edge colourings
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
- List-colourings
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- List proper connection of 2-edge-connected graphs
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- List supermodular coloring with shorter lists
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
- List supermodular coloring
- Precoloring extension. I: Interval graphs
- On list-coloring outerplanar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Acyclic sum-list-colouring of grids and other classes of graphs
- A note on edge-choosability of planar graphs without intersecting 4-cycles
- A note on list-colorings
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- The total chromatic number of nearly complete bipartite graphs
- List-graph colouring for multiple depot vehicle scheduling
- List Dynamic Coloring of Sparse Graphs
- List colouring when the chromatic number is close to the order of the graph
- Interval edge coloring of a graph with forbidden colors
- Title not available (Why is that?)
- On neighbour-distinguishing colourings from lists
- List coloring triangle-free hypergraphs
- Graphic and protographic lists of integers
- Towards a solution of the Dinitz problem?
- A new upper bound for the list chromatic number
- List coloring of matroids and base exchange properties
- Near-optimal list colorings
- Choosability, edge choosability and total choosability of outerplane graphs
- A note on total and list edge-colouring of graphs of tree-width 3
- Partial list colouring of certain graphs
- \(T\)-colorings of graphs: recent results and open problems
- Two Chromatic Conjectures: One for Vertices and One for Edges
- Amenable colorings
- Blocking set free configurations and their relations to digraphs and hypergraphs
- Title not available (Why is that?)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- A note on edge-group choosability of planar graphs without 5-cycles
- The Dinitz problem solved for rectangles
- Edge-group choosability of outerplanar and near-outerplanar graphs
- Title not available (Why is that?)
- List edge colorings of planar graphs without adjacent 7-cycles
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- A note on Latin squares with restricted support
- The parameterised complexity of list problems on graphs of bounded treewidth
- List coloring digraphs
- List Colouring Squares of Planar Graphs
- List-coloring embedded graphs
- Computing the list chromatic index of graphs
- On the upper embedding of symmetric configurations with block size 3
- Asymptotically good list-colorings
- Tight embeddings of partial quadrilateral packings
- Pfaffian labelings and signs of edge colorings
- An introduction to the discharging method via graph coloring
- List edge-coloring and total coloring in graphs of low treewidth
- An upper bound for the total chromatic number
- List \(T\)-colorings of graphs
- List colorings and reducibility
- Extending fixed vertex-colourings to total colourings
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- List edge and list total coloring of planar graphs without intersecting 8-cycles
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- Color-blind index in graphs of very low degree
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 Q1084403)
