The following pages link to List-colourings of graphs (Q1084403):
Displaying 50 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)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← 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)
- List-graph colouring for multiple depot vehicle scheduling (Q843401) (← links)
- Partial list colouring of certain graphs (Q888600) (← 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)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- Graphic and protographic lists of integers (Q1422142) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Asymptotically good list-colorings (Q1906118) (← 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)
- List supermodular coloring with shorter lists (Q2322511) (← links)
- List coloring of matroids and base exchange properties (Q2349974) (← links)
- List supermodular coloring (Q2419323) (← 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)
- List-colourings (Q2822593) (← links)
- (Q3110121) (← links)
- On neighbour-distinguishing colourings from lists (Q3439452) (← links)
- List coloring triangle-free hypergraphs (Q3452728) (← links)
- List Colouring Squares of Planar Graphs (Q3503513) (← links)
- On list-coloring outerplanar graphs (Q3528160) (← links)
- A note on list-colorings (Q3828020) (← links)
- (Q4263476) (← links)
- The Dinitz problem solved for rectangles (Q4275683) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- List coloring digraphs (Q4638642) (← links)
