Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings.
Peter BradshawPublished in: J. Graph Theory (2022)
Keyphrases
- bounded treewidth
- graph coloring
- graph mining
- np complete
- graph databases
- graph properties
- labeled graphs
- graph structure
- subgraph mining
- graph structures
- decision problems
- graph data
- data structure
- subgraph isomorphism
- graph theoretic
- reachability queries
- upper bound
- graph search
- frequent subgraphs
- maximum clique
- frequent subgraph mining
- subgraph matching
- connected subgraphs
- graph theory
- boolean functions
- quasi cliques
- connected graphs
- np hard
- search space
- biological networks
- conjunctive queries
- database schemes
- random walk
- dense subgraphs
- tree decompositions
- max sat
- graphical representation
- combinatorial problems
- link analysis
- weighted graph
- connected components
- pattern mining
- structured data