Ohba's conjecture for graphs with independence number five (Q536225): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.02.026 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q123009835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice number of some complete multi-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic‐choosable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549228 / 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
Property / cites work
 
Property / cites work: Ohba's conjecture is true for graphs with independence number at most three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On choosability of some complete multipartite graphs and Ohba's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452942 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.02.026 / rank
 
Normal rank

Latest revision as of 20:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Ohba's conjecture for graphs with independence number five
scientific article

    Statements

    Ohba's conjecture for graphs with independence number five (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2011
    0 references
    chromatic number
    0 references
    vertex coloring
    0 references
    list coloring
    0 references
    list chromatic number
    0 references
    choosability
    0 references
    complete multipartite graph
    0 references

    Identifiers