Pages that link to "Item:Q1121274"
From MaRDI portal
The following pages link to A new upper bound for the list chromatic number (Q1121274):
Displaying 11 items.
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Chessboard squares (Q1894757) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- The Dinitz problem solved for rectangles (Q4275683) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Amenable colorings (Q5906786) (← links)
