Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 50 items.
- Answers to two questions on the DP color function (Q2030743) (← links)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← links)
- Isotopy graphs of Latin tableaux (Q2048368) (← links)
- The Alon-Tarsi number of \(K_5\)-minor-free graphs (Q2075517) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Alon-Tarsi numbers of direct products (Q2077275) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Special case of Rota's basis conjecture on graphic matroids (Q2088711) (← links)
- Tensor slice rank and Cayley's first hyperdeterminant (Q2093514) (← links)
- An inequality in mixed multiplicities (Q2108565) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) (Q2305911) (← links)
- Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- The Alon-Tarsi conjecture: a perspective on the main results (Q2319705) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← links)
- Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group (Q2339440) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Wreath determinants for group-subgroup pairs. (Q2347878) (← links)
- Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry (Q2347979) (← links)
- An online version of Rota's basis conjecture (Q2354051) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- Beyond degree choosability (Q2401410) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Extended skew partition problem (Q2433705) (← links)
- The game of arboricity (Q2476280) (← links)
- Algebraic characterization of uniquely vertex colorable graphs (Q2477631) (← links)
- Parity, Eulerian subgraphs and the Tutte polynomial (Q2483482) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)