Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123239294 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.5380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having prescribed clique number, chromatic number, and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with $\chi=\Delta$ Have Big Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697042 / 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: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choosability of complete multipartite graphs with part size three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fractional Analogue of Brooks' Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The colour theorems of Brooks and Gallai extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hitting all maximum cliques with an independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colouring when the chromatic number is close to the order of the graph / rank
 
Normal rank

Latest revision as of 08:15, 9 July 2024

scientific article
Language Label Description Also known as
English
Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
scientific article

    Statements

    Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (English)
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references