Login / Signup

The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4.

Daniel W. CranstonLandon Rabern
Published in: SIAM J. Discret. Math. (2019)
Keyphrases
  • random graphs
  • series parallel
  • graph matching
  • graph theoretic
  • low degree
  • graph structure
  • structured objects
  • data sets
  • case study
  • graph mining
  • graph databases
  • complex structures
  • degree distribution