List-colourings of graphs
From MaRDI portal
Publication:1084403
DOI10.1007/BF02582936zbMath0606.05027OpenAlexW2019973212MaRDI QIDQ1084403
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582936
total chromatic numberchromatic number of hypergraphconjecture of Albertson and Tuckeredge list-chromatic number
Related Items (42)
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ The Dinitz problem solved for rectangles ⋮ Blocking set free configurations and their relations to digraphs and hypergraphs ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Towards a solution of the Dinitz problem? ⋮ A note on Latin squares with restricted support ⋮ A new upper bound for the list chromatic number ⋮ Extending fixed vertex-colourings to total colourings ⋮ List Ramsey numbers ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Colouring problems for symmetric configurations with block size 3 ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph ⋮ A note on edge-group choosability of planar graphs without 5-cycles ⋮ Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ An introduction to the discharging method via graph coloring ⋮ Pfaffian labelings and signs of edge colorings ⋮ Precoloring extension. I: Interval graphs ⋮ Color-blind index in graphs of very low degree ⋮ Tight embeddings of partial quadrilateral packings ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Amenable colorings ⋮ The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ Near-optimal list colorings ⋮ An upper bound for the total chromatic number ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ On the upper embedding of symmetric configurations with block size 3 ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ Interval edge coloring of a graph with forbidden colors ⋮ List \(T\)-colorings of graphs ⋮ A brief history of edge-colorings – with personal reminiscences
Cites Work
This page was built for publication: List-colourings of graphs
