Login / Signup

A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs.

Shuya ChibaMichitaka Furuya
Published in: Discret. Math. (2021)
Keyphrases
  • graph clustering
  • website
  • pattern recognition
  • connected components
  • graph partitioning
  • adjacency matrix
  • attributed graphs
  • evolutionary algorithm
  • binary images
  • graph matching
  • graph representation