4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$.
Sean KimMichael E. PicollelliPublished in: Electron. J. Comb. (2024)
Keyphrases
- color images
- graph matching
- maximum number
- neural network
- series parallel
- graph representation
- graph theoretic
- random graphs
- total length
- graph theory
- human perception
- graph partitioning
- adjacency matrix
- graph structures
- structured objects
- subgraph isomorphism
- fixed length
- graph model
- weighted graph
- bipartite graph
- search engine