Edge coloring of graphs, uses, limitation, complexity (Q2629566): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3145799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An exact algorithm for the maximum clique problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Test case generators and computational results for the maximum clique problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5705147 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur le coloriage des graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank |
Latest revision as of 06:20, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Edge coloring of graphs, uses, limitation, complexity |
scientific article |
Statements
Edge coloring of graphs, uses, limitation, complexity (English)
0 references
6 July 2016
0 references
clique
0 references
maximum clique
0 references
maximal clique
0 references
clique search algorithms
0 references
vertex coloring
0 references
edge coloring
0 references