Login / Signup

A characterization of well-covered graphs that contain neither 4- nor 5-cycles.

Art Stephen FinbowBert L. HartnellRichard J. Nowakowski
Published in: J. Graph Theory (1994)
Keyphrases
  • graph matching
  • graph mining
  • graph databases
  • directed graph
  • graph theoretic
  • random walk
  • graph theory
  • real world
  • case study
  • weighted graph
  • spanning tree
  • graph representation
  • graph clustering
  • structured objects