Improper colouring of graphs with no odd clique minor.
Dong Yeap KangSang-il OumPublished in: Comb. Probab. Comput. (2019)
Keyphrases
- independent set
- graph properties
- maximum clique
- quasi cliques
- maximal clique enumeration
- graph theory
- graph matching
- weighted graph
- graph theoretic
- maximal cliques
- maximum weight
- database
- graph partitioning
- subgraph isomorphism
- series parallel
- graph construction
- structured objects
- fixed number
- complex structures
- undirected graph
- maximum independent set
- similarity measure