A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs.
Roman KuzelPublished in: Discret. Math. (2008)
Keyphrases
- graph mining
- graph databases
- weighted graph
- subgraph isomorphism
- graph properties
- labeled graphs
- subgraph matching
- maximum common subgraph
- connected components
- undirected graph
- graph structures
- subgraph mining
- graph data
- connected subgraphs
- reachability queries
- frequent subgraph mining
- circuit design
- graph model
- maximum clique
- directed graph
- dense subgraphs
- minimum spanning trees
- connected graphs
- graph theoretic
- vertex set
- graph clustering
- graph patterns
- query graph
- high speed
- graph theory
- pattern mining
- edge detection
- graph search
- quasi cliques
- multiscale
- edge weights
- edge information
- data structure
- b spline
- topological information
- graph matching
- frequent subgraphs
- neighborhood graph
- power consumption
- densely connected
- electronic circuits
- structured data
- biological networks
- graph representation