Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10255-015-0531-z / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10255-015-0531-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2272208099 / 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: 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 the choosability of complete multipartite graphs with part size three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ohba's conjecture for graphs with independence number five / 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: List colouring when the chromatic number is close to the order of the graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549228 / 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 / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On choosability of complete multipartite graphs K<sub>4,3*t,2*(k-2t-2),1*(t+1)</sub> / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123016457 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10255-015-0531-Z / rank
 
Normal rank

Latest revision as of 13:14, 9 December 2024

scientific article
Language Label Description Also known as
English
Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
scientific article

    Statements

    Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2016
    0 references
    list coloring
    0 references
    chromatic-choosable graphs
    0 references
    Ohba's conjecture
    0 references
    \(f\)-choosable
    0 references
    complete multipartite graphs
    0 references

    Identifiers