Coloring the edges of a directed graph
From MaRDI portal
Publication:2353348
DOI10.1007/s13226-014-0061-zzbMath1320.05053OpenAlexW2011428344MaRDI QIDQ2353348
Publication date: 9 July 2015
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-014-0061-z
graph coloringNP-complete problemsdirected graphtournamentcliquemaximum cliquetransitive tournamentcoloring the nodescoloring the edgesmaximum tournament
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- The Voting Problem
- On Sets of Consistent Arcs in a Tournament
- Algorithms for finding maximum transitive subtournaments
This page was built for publication: Coloring the edges of a directed graph