Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.
Guantao ChenHikoe EnomotoKenta OzekiShoichi TsuchiyaPublished in: SIAM J. Discret. Math. (2015)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- graph classification
- graph data
- graph properties
- labeled graphs
- frequent subgraph mining
- graph matching
- graph theory
- maximum clique
- subgraph mining
- graph theoretic
- frequent subgraphs
- graph clustering
- graph search
- graph patterns
- edge weights
- graph model
- graph structures
- three dimensional
- graph partitioning
- query graph
- graph structure
- directed graph
- light source
- d objects
- dense subgraphs
- np hard