Login / Signup

Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path.

Benjamin Momège
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • hamiltonian path
  • graph theoretic
  • connected components
  • graph theory
  • graph structure
  • neural network
  • bipartite graph
  • neighborhood graph
  • random walk
  • directed graph
  • graph model
  • random graphs
  • dependency graph