Long paths through four vertices in a 2-connected graph.
Mark V. BarovichPublished in: J. Graph Theory (2000)
Keyphrases
- connected graphs
- weighted graph
- connected components
- adjacency matrix
- shortest path
- edge weights
- random graphs
- undirected graph
- hamiltonian cycle
- labeled graphs
- graph representation
- directed edges
- maximum matching
- average degree
- minimum weight
- neighborhood graph
- bipartite graph
- random walk
- directed graph
- graph theory
- spanning tree
- graph model
- directed acyclic graph
- graph theoretic
- structured data
- minimal paths
- query graph
- graph search
- attributed graphs
- vertex set
- stable set
- graph matching
- disjoint paths
- maximum cardinality
- graph clustering
- maximal cliques
- strongly connected
- endpoints
- graph structures
- betweenness centrality
- binary images
- graph construction
- graph databases