Chromatic-choosability of the power of graphs (Q476310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Choice Numbers of Graphs: a Probabilistic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / 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: Choice number of 3-colorable elementary graphs / 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: Counterexamples to the List Square Coloring Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list-coloring powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability conjectures and multicircuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of a Conjecture of Ohba / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic‐choosable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank

Revision as of 08:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Chromatic-choosability of the power of graphs
scientific article

    Statements

    Identifiers