Login / Signup
Graphs without five-vertex path and four-vertex cycle.
Shujuan Cao
Shenwei Huang
Published in:
Appl. Math. Comput. (2019)
Keyphrases
</>
directed graph
undirected graph
attributed graphs
hamiltonian cycle
edge weights
labeled graphs
connected subgraphs
vertex set
real time
graph matching
minimum weight
average degree
information systems
shortest path
minimum cost
strongly connected