Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.
Zhi-Hong ChenHong-Jian LaiXiangwen LiDeying LiJingzhong MaoPublished in: J. Graph Theory (2003)
Keyphrases
- connected graphs
- graph databases
- graph mining
- weighted graph
- edge detection
- maximum common subgraph
- closed form
- markov random field
- graph properties
- labeled graphs
- subgraph isomorphism
- edge detector
- data structure
- subgraph matching
- graph structures
- edge segments
- maximum clique
- graph data
- minimum spanning trees
- frequent subgraph mining
- subgraph mining
- intersection points
- line segments
- quasi cliques
- frequent subgraphs
- reachability queries
- dense subgraphs
- connected subgraphs
- pattern mining
- partial differential equations