Acyclic Vertex Coloring of Graphs of Maximum Degree Six (Q2840537): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56390819, #quickstatements; #temporary_batch_1710289860281 |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.11.030 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2179060914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111593 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On acyclic colorings of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4180377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3576724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic colorings of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic colorings of subcubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic vertex coloring of graphs of maximum degree 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic Vertex Coloring of Graphs of Maximum Degree Six / rank | |||
Normal rank |
Latest revision as of 15:18, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Acyclic Vertex Coloring of Graphs of Maximum Degree Six |
scientific article |
Statements
Acyclic Vertex Coloring of Graphs of Maximum Degree Six (English)
0 references
19 July 2013
0 references
graph theory
0 references
analysis of algorithms
0 references