Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 46 items.
- On the Dinitz conjecture and related conjectures (Q1901032) (← links)
- An exchange property of matroids (Q1903740) (← links)
- A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
- Choosability of planar graphs (Q1916256) (← links)
- Matrix choosability (Q1976325) (← 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)
- 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)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← 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)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- List colourings of planar graphs. (Reprint) (Q2498006) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- A compactness argument in the additive theory and the polynomial method. (Q2575791) (← links)
- Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” (Q2851468) (← links)
- How<i>not</i>to prove the Alon-Tarsi conjecture (Q2880835) (← links)
- Crypto Galore! (Q2908530) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- ADDITIVE BASES IN ABELIAN GROUPS (Q3578421) (← links)
- ON THE NUMBER OF LATIN RECTANGLES (Q3580003) (← links)
- Circular choosability via combinatorial Nullstellensatz (Q3605148) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- The Dinitz problem solved for rectangles (Q4275683) (← links)
- Choice Numbers of Graphs: a Probabilistic Approach (Q4291205) (← links)
- Total choosability of multicircuits I (Q4537554) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Discriminants, Symmetrized Graph Monomials, and Sums Of Squares (Q4908499) (← links)
- A study of the representations supported by the orbit closure of the determinant (Q4982978) (← links)
- Total weight choosability of graphs (Q5894172) (← links)
- Amenable colorings (Q5906786) (← links)