Login / Signup

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.

Hebert CoelhoLuérbio FariaSylvain GravierSulamita Klein
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • bounded treewidth
  • graph theoretic
  • bounded degree
  • information retrieval
  • relational databases
  • optimization problems
  • directed graph
  • bipartite graph
  • undirected graph
  • graph partitioning