The following pages link to (Q3142409):
Displaying 50 items.
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Jacobsthal numbers in generalised Petersen graphs (Q322296) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- The list-chromatic number of infinite graphs (Q375873) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (Q466092) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Hypergraph containers (Q496210) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- The list-chromatic number of infinite graphs defined on Euclidean spaces (Q633199) (← links)
- The adaptable choosability number grows with the choosability number (Q641204) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Chip games and paintability (Q726662) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- On list critical graphs (Q1044925) (← links)
- The concentration of the chromatic number of random graphs (Q1280244) (← links)
- The choice number of random bipartite graphs (Q1293418) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- Arrays of distinct representatives --- a very simple NP-complete problem (Q1363713) (← links)
- \(T\)-choosability in graphs (Q1383364) (← links)
- Cardinal invariants of closed graphs (Q1617948) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- Choosability in random hypergraphs (Q1850565) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- The odd-distance plane graph (Q2391203) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) (Q2478163) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
