On two generalizations of the Alon-Tarsi polynomial method (Q651032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041832100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0911.2099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation between choosability and uniquely list colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nowhere-zero point in linear mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graph colorings and graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-choosability in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely Colourable Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniquely colorable planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge colourings of some 1-factorable multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to a colouring problem of P. Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brooks' theorem via the Alon-Tarsi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Penrose number of cubic diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of uniquely vertex k-colorable graphs with minimum possible size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs and generators of ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Independence Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability of powers of circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extension of the Alon-Tarsi list coloring theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mr. Paint and Mrs. Correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edge 3-colorings of a planar cubic graph as a permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph polynomial and the number of proper vertex colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of uniquely colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line list colouring of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:09, 4 July 2024

scientific article
Language Label Description Also known as
English
On two generalizations of the Alon-Tarsi polynomial method
scientific article

    Statements

    On two generalizations of the Alon-Tarsi polynomial method (English)
    0 references
    0 references
    8 December 2011
    0 references
    0 references
    polynomial method
    0 references
    combinatorial Nullstellensatz
    0 references
    list coloring
    0 references
    uniquely colorable graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references