The following pages link to (Q3922703):
Displayed 50 items.
- Entire choosability of near-outerplane graphs (Q1025470) (← links)
- Sum choice numbers of some graphs (Q1025471) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
- On list critical graphs (Q1044925) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Towards a solution of the Dinitz problem? (Q1118600) (← links)
- A new upper bound for the list chromatic number (Q1121274) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- The list chromatic numbers of some planar graphs (Q1288297) (← links)
- The Hall number, the Hall index, and the total Hall number of a graph (Q1293202) (← links)
- The choice number of random bipartite graphs (Q1293418) (← 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)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- The colour theorems of Brooks and Gallai extended (Q1356682) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- On the number of even and odd Latin squares of order \(p+1\) (Q1362611) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Color-critical graphs on a fixed surface (Q1369650) (← links)
- Some results on list \(T\)-colourings (Q1377778) (← 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)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- On list edge-colorings of subcubic graphs (Q1584301) (← links)
- Choosability of \(K_5\)-minor-free graphs (Q1584404) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)