On vertex-degree restricted paths in polyhedral graphs.
Igor FabriciErhard HexelStanislav Jendrol'Hansjoachim WaltherPublished in: Discret. Math. (2000)
Keyphrases
- undirected graph
- directed graph
- attributed graphs
- random graphs
- labeled graphs
- graph theoretic
- maximum cardinality
- graph matching
- average degree
- hamiltonian cycle
- vertex set
- graph theory
- convex hull
- graph mining
- shortest path
- connected subgraphs
- series parallel
- graph representation
- betweenness centrality
- minimum weight
- optimal path
- edge weights
- social networks
- graph databases
- graph structure
- bipartite graph
- line drawings
- pattern recognition
- image segmentation