The following pages link to List-colourings of graphs (Q1084403):
Displaying 34 items.
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- Towards a solution of the Dinitz problem? (Q1118600) (← links)
- A note on Latin squares with restricted support (Q1118601) (← links)
- A new upper bound for the list chromatic number (Q1121274) (← links)
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs (Q1173768) (← links)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- Blocking set free configurations and their relations to digraphs and hypergraphs (Q1356757) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- A note on edge-group choosability of planar graphs without 5-cycles (Q2221861) (← links)
- An upper bound for the total chromatic number (Q2277479) (← links)
- On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- List Edge-Coloring and Total Coloring in Graphs of Low Treewidth (Q2800543) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- List Ramsey numbers (Q6055384) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
- Colouring problems for symmetric configurations with block size 3 (Q6186660) (← links)
