The following pages link to List-colourings of graphs (Q1084403):
Displaying 16 items.
- Acyclic sum-list-colouring of grids and other classes of graphs (Q4690984) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- List Dynamic Coloring of Sparse Graphs (Q5199147) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- Amenable colorings (Q5906786) (← 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)
- List proper connection of 2-edge-connected graphs (Q6644889) (← links)