Obstructions for three-coloring graphs without induced paths on six vertices.
Maria ChudnovskyJan GoedgebeurOliver SchaudtMingxian ZhongPublished in: J. Comb. Theory, Ser. B (2020)
Keyphrases
- weighted graph
- labeled graphs
- undirected graph
- random graphs
- shortest path
- attributed graphs
- adjacency matrix
- edge weights
- maximal cliques
- graph theoretic
- hamiltonian cycle
- planar graphs
- directed graph
- graph theory
- average degree
- connected subgraphs
- maximum cardinality
- graph clustering
- query graph
- directed edges
- connected graphs
- graph kernels
- optimal path
- graph partitioning
- graph databases
- graph model
- bipartite graph
- graph construction
- graph search
- minimum spanning tree
- series parallel
- spanning tree
- np hard
- pairwise
- neural network
- data sets