Semialgebraic graphs having countable list-chromatic numbers (Q2790252): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1090/proc/12832 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: What must and what need not be contained in a graph of uncountable chromatic number? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theorem for R n / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list-chromatic number of infinite graphs defined on Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list-chromatic number of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1090/PROC/12832 / rank
 
Normal rank

Latest revision as of 16:00, 28 December 2024

scientific article
Language Label Description Also known as
English
Semialgebraic graphs having countable list-chromatic numbers
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references