Consecutive colorings of graphs (Q3770560): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on strong perfectness of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality for the chromatic number of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank | |||
Normal rank |
Latest revision as of 13:43, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Consecutive colorings of graphs |
scientific article |
Statements
Consecutive colorings of graphs (English)
0 references
1988
0 references
node colorings
0 references
bounds
0 references
perfect graphs
0 references