Login / Signup

Coloring vertices and edges of a graph by nonempty subsets of a set.

Paul N. BalisterErvin GyöriRichard H. Schelp
Published in: Eur. J. Comb. (2011)
Keyphrases
  • undirected graph
  • vertex set
  • directed graph
  • weighted graph
  • maximum matching
  • small number
  • shortest path
  • complex networks
  • graph structure
  • directed acyclic graph
  • graph model
  • edge weights
  • dependency graph