Coloring the edges of a directed graph (Q2353348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6456925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring the edges of a directed graph |
scientific article; zbMATH DE number 6456925 |
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
0.8164734840393066
0 references
0.7229771018028259
0 references
0.722434937953949
0 references
0.716020941734314
0 references
0.7151374816894531
0 references
