Linear choosability of sparse graphs (Q2275448): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear choosability of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic colorings of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colouring a graph frugally / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear coloring of planar graphs with large girth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3115277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear coloring of graphs / rank | |||
Normal rank |
Latest revision as of 09:44, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear choosability of sparse graphs |
scientific article |
Statements
Linear choosability of sparse graphs (English)
0 references
9 August 2011
0 references
linear coloring
0 references
list coloring
0 references
planar graph
0 references
discharging method
0 references
maximum average degree
0 references