Graphs without a 3-connected subgraph are 4-colorable.
Édouard BonnetCarl FeghaliStéphan ThomasséNicolas TrotignonPublished in: CoRR (2024)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- graph classification
- connected components
- labeled graphs
- graph properties
- graph data
- query graph
- frequent subgraph mining
- connected subgraphs
- graph theory
- dense subgraphs
- frequent subgraphs
- maximum clique
- graph theoretic
- graph matching
- neighborhood graph
- connected graphs
- graph representation
- link prediction
- pattern mining
- subgraph mining
- graph kernels
- graph structures
- graph search
- web pages
- edge weights
- undirected graph
- spanning tree
- graph model
- semi supervised
- knn