Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2015986552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear choosability of sparse graphs / 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: Linear coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear coloring of planar graphs with large girth / rank | |||
Normal rank |
Latest revision as of 20:23, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear and 2-frugal choosability of graphs of small maximum average degree |
scientific article |
Statements
Linear and 2-frugal choosability of graphs of small maximum average degree (English)
0 references
24 January 2012
0 references
linear colouring
0 references
frugal colouring
0 references
planar graph
0 references
discharging method
0 references