Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.
Maria ChudnovskyChun-Hung LiuOliver SchaudtSophie SpirklNicolas TrotignonKristina VuskovicPublished in: J. Graph Theory (2019)
Keyphrases
- graph matching
- graph theory
- database
- data mining
- machine learning
- graph representation
- graph isomorphism
- attributed graphs
- subgraph isomorphism
- graph clustering
- graph theoretic
- graph model
- graph structure
- directed graph
- graph construction
- graph structures
- graph theoretical
- information retrieval
- structured objects
- neural network