Login / Signup

Ore-type degree conditions for disjoint path covers in simple graphs.

Hyeong-Seok LimHee-Chul KimJung-Heum Park
Published in: Discret. Math. (2016)
Keyphrases
  • sufficient conditions
  • learning algorithm
  • pairwise
  • shortest path
  • query processing
  • path planning
  • graph matching
  • graph theory
  • spanning tree