The following pages link to (Q3115277):
Displayed 50 items.
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Vertex coloring complete multipartite graphs from random lists of size 2 (Q539865) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Coloring graphs from random lists of size 2 (Q658000) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
- Entire choosability of near-outerplane graphs (Q1025470) (← links)
- Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- On \(b\)-colorings in regular graphs (Q1026139) (← links)
- Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- The colour theorems of Brooks and Gallai extended (Q1356682) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- \(T\)-choosability in graphs (Q1383364) (← links)
- On a list-coloring problem (Q1398274) (← links)
- Improper choosability of graphs embedded on the surface of genus \(r\) (Q1402089) (← links)
- Choosability of \(K_5\)-minor-free graphs (Q1584404) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- Graph imperfection. I (Q1850556) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
- Choosability of planar graphs (Q1916256) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)