Coloring the edges of a directed graph (Q2353348): 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: Q5509547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Sets of Consistent Arcs in a Tournament / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for finding maximum transitive subtournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2837833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5705147 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585195 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4298260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Voting Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4452109 / rank | |||
Normal rank | |||
Latest revision as of 12:22, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring the edges of a directed graph |
scientific article |
Statements
Coloring the edges of a directed graph (English)
0 references
9 July 2015
0 references
One of the interesting and important discrete mathematics problems is finding large cliques in graphs, which corresponds with finding subtournaments in digraphs. It is known that coloring the graph makes finding the large cliques much easier. The authors present colorings that facilitate the searching of subtournament in digraphs.
0 references
clique
0 references
maximum clique
0 references
graph coloring
0 references
coloring the nodes
0 references
coloring the edges
0 references
NP-complete problems
0 references
directed graph
0 references
tournament
0 references
transitive tournament
0 references
maximum tournament
0 references
