Login / Signup

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs.

Toru HasunumaToshimasa IshiiHirotaka OnoYushi Uno
Published in: J. Discrete Algorithms (2012)
Keyphrases
  • graph mining
  • graph databases
  • active learning
  • graph model
  • graph isomorphism
  • data mining
  • structured data
  • frequent subgraphs