Three-coloring graphs with no induced seven-vertex path II : using a triangle.
Maria ChudnovskyPeter MaceliMingxian ZhongPublished in: CoRR (2015)
Keyphrases
- undirected graph
- directed graph
- edge weights
- labeled graphs
- attributed graphs
- hamiltonian cycle
- strongly connected
- shortest path
- graph matching
- graph structure
- minimum length
- minimum weight
- graph theoretic
- graph mining
- average degree
- connected subgraphs
- maximum cardinality
- finding the shortest path
- weighted graph
- graph theory
- bipartite graph
- random graphs
- graph clustering
- graph databases
- minimum cost
- graph model
- np complete
- data sets
- database