On long cycles through four prescribed vertices of a polyhedral graph.
Jochen HarantStanislav Jendrol'Hansjoachim WaltherPublished in: Discuss. Math. Graph Theory (2008)
Keyphrases
- weighted graph
- edge weights
- random graphs
- undirected graph
- labeled graphs
- adjacency matrix
- attributed graphs
- maximum matching
- vertex set
- graph theory
- graph model
- hamiltonian cycle
- spanning tree
- graph structure
- bipartite graph
- planar graphs
- average degree
- maximal cliques
- random walk
- graph search
- graph partitioning
- structured data
- minimum weight
- query graph
- directed graph
- betweenness centrality
- graph clustering
- graph representation
- maximum cardinality
- directed edges
- graph mining
- description logics
- densely connected
- connected subgraphs
- connected graphs