Colorings and orientations of graphs
From MaRDI portal
Publication:1196681
DOI10.1007/BF01204715zbMath0756.05049WikidataQ56390729 ScholiaQ56390729MaRDI QIDQ1196681
Publication date: 16 January 1993
Published in: Combinatorica (Search for Journal in Brave)
Related Items
The Dinitz problem solved for rectangles, Choice Numbers of Graphs: a Probabilistic Approach, Total choosability of multicircuits I, Total choosability of multicircuits II, Coloration de graphes : fondements et applications, Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph, Discriminants, Symmetrized Graph Monomials, and Sums Of Squares, A study of the representations supported by the orbit closure of the determinant, Total weight choosability of graphs, Amenable colorings, Total weight choosability of Cartesian product of graphs, The Combinatorial Nullstellensätze revisited, Orientations of graphs with prescribed weighted out-degrees, Dynamic list coloring of bipartite graphs, Distinguishing graphs by their left and right homomorphism profiles, On two generalizations of the Alon-Tarsi polynomial method, On 3-choosability of triangle-free plane graphs, List colourings of planar graphs, Nowhere-zero flow polynomials, On 3-colorings of plane graphs, Brooks' theorem via the Alon-Tarsi theorem, Circular list colorings of some graphs, Group coloring is \(\Pi_2^{\text{P}}\)-complete, Pfaffian labelings and signs of edge colorings, On 3-choosability of planar graphs without certain cycles, Lucky labelings of graphs, Ore-type versions of Brooks' theorem, The chromatic polynomial and list colorings, From a zoo to a zoology: Towards a general theory of graph polynomials, Restricted set addition: the exceptional case of the Erdős-Heilbronn conjecture, Some results on \((a:b)\)-choosability, On 3-choosable planar graphs of girth at least 4, Injective colorings of planar graphs with few colors, Planar graphs without 3-, 7-, and 8-cycles are 3-choosable, Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable, The complexity of planar graph choosability, List homomorphisms to reflexive graphs, A solution to a colouring problem of P. Erdős, Binary invariants and orientations of graphs, Sumsets in vector spaces over finite fields, The list chromatic numbers of some planar graphs, The graph polynomial and the number of proper vertex colorings, The 4-choosability of plane graphs without 4-cycles, Stable sets and polynomials, On the relations of various conjectures on Latin squares and straightening coefficients, Algorithmic complexity of list colorings, On even and odd latin squares, Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension, On the number of even and odd Latin squares of order \(p+1\), The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture, A note on graph colorings and graph polynomials, \(T\)-choosability in graphs, Chords of longest cycles in cubic graphs, On 3-choosability of plane graphs without 6-, 7- and 9-cycles, The oriented cycle game, Generalized list \(T\)-colorings of cycles, The 3-choosability of plane graphs of girth 4, Choosability, edge choosability and total choosability of outerplane graphs, On structure of some plane graphs with application to choosability, Coloring face-hypergraphs of graphs on surfaces, Density via duality., On 2-coloring certain \(k\)-uniform hypergraphs, On the Dinitz conjecture and related conjectures, An exchange property of matroids, A not 3-choosable planar graph without 3-cycles, Choosability of planar graphs, Matrix choosability, On the complexity of Hilbert refutations for partition, The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges, Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group, An algebraic criterion for the choosability of graphs, Geometric complexity theory: an introduction for geometers, Wreath determinants for group-subgroup pairs., Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry, An online version of Rota's basis conjecture, Recognizing \(d\)-interval graphs and \(d\)-track interval graphs, A sufficient condition for a planar graph to be 3-choosable, Perfect graphs, kernels, and cores of cooperative games, Extended skew partition problem, The game of arboricity, Algebraic characterization of uniquely vertex colorable graphs, Parity, Eulerian subgraphs and the Tutte polynomial, Bordeaux 3-color conjecture and 3-choosability, A relation between choosability and uniquely list colorability, List colourings of planar graphs. (Reprint), List edge colourings of some 1-factorable multigraphs, A note on 3-choosability of planar graphs without certain cycles, A compactness argument in the additive theory and the polynomial method., Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”, Hownotto prove the Alon-Tarsi conjecture, Crypto Galore!, Some Combinatorial Applications of Gröbner Bases, Choosability of toroidal graphs without short cycles, Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz, ADDITIVE BASES IN ABELIAN GROUPS, ON THE NUMBER OF LATIN RECTANGLES, Circular choosability via combinatorial Nullstellensatz, Weight choosability of graphs
Cites Work
- Unnamed Item
- Independence numbers of graphs and generators of ideals
- Regular subgraphs of almost regular graphs
- A nowhere-zero point in linear mappings
- On the decomposition of a graph into stars
- Acyclic orientations of graphs
- A note on list-colorings
- Tournaments and Vandermond's determinant
- On the Structure oft-Designs
