The following pages link to (Q3115277):
Displaying 15 items.
- 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)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- On the multicriterial problem of the search for optimal sources in a graph (Q2736212) (← links)
- Amenable colorings (Q5906786) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)