Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 50 items.
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- List colourings of planar graphs. (Reprint) (Q2498006) (← links)
- The odd case of Rota's bases conjecture (Q2517379) (← links)
- Completing partial proper colorings using Hall's condition (Q2517653) (← 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)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Symmetric group characters of almost square shape (Q2674555) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- Relation between the correspondence chromatic number and the Alon-Tarsi number (Q2699913) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← 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)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- Jacobsthal Numbers in Generalized Petersen Graphs (Q2958204) (← links)
- A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
- THERE ARE ASYMPTOTICALLY THE SAME NUMBER OF LATIN SQUARES OF EACH PARITY (Q2986528) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← 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)
- 3-Paintability of planar graphs (Q4554554) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- On Zeros of a Polynomial in a Finite Grid (Q4635504) (← 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)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- General Parity Result and Cycle‐Plus‐Triangles Graphs (Q4978447) (← links)
- A study of the representations supported by the orbit closure of the determinant (Q4982978) (← links)
- Mixing properties of colourings of the ℤ<i><sup>d</sup></i> lattice (Q4993128) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- The polynomial method for list-colouring extendability of outerplanar graphs (Q5020296) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)