On the Erdős-Sós conjecture for graphs having no path with k+4 vertices.
Nancy EatonGary TinerPublished in: Discret. Math. (2013)
Keyphrases
- weighted graph
- edge weights
- labeled graphs
- attributed graphs
- random graphs
- shortest path
- undirected graph
- adjacency matrix
- hamiltonian cycle
- connected subgraphs
- planar graphs
- graph matching
- strongly connected
- directed edges
- maximum cardinality
- graph theoretic
- directed graph
- vertex set
- average degree
- graph structure
- graph theory
- maximal cliques
- neural network
- optimal path
- query graph
- finding the shortest path
- connected graphs
- real world networks
- densely connected
- minimum spanning tree
- graph partitioning
- endpoints
- data objects
- random walk