Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable.
Wenan ZangPublished in: J. Comb. Optim. (1998)
Keyphrases
- directed graph
- graph theory
- random walk
- graph representation
- structured data
- graph matching
- graph structure
- stable set
- special case
- graph model
- neural network
- random graphs
- graph theoretic
- graph partitioning
- graph databases
- theorem prover
- case study
- bipartite graph
- connected components
- pairwise
- information systems
- information retrieval
- graph construction
- dependency graph
- data sets