Upper bounds on the linear chromatic number of a graph (Q626759): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Structural theorem on plane graphs with application to the entire coloring number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear choosability of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colouring a graph frugally / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring the square of a planar graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear coloring of graphs embeddable in a surface of nonnegative characteristic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear coloring of graphs / rank | |||
Normal rank |
Latest revision as of 19:35, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds on the linear chromatic number of a graph |
scientific article |
Statements
Upper bounds on the linear chromatic number of a graph (English)
0 references
18 February 2011
0 references
linear coloring
0 references
planar graph
0 references
maximum degree
0 references