Coloring graphs with no induced five-vertex path or gem.
Maria ChudnovskyKarthick ThiyagarajanPeter MaceliFrédéric MaffrayPublished in: CoRR (2018)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- edge weights
- hamiltonian cycle
- strongly connected
- maximum cardinality
- minimum weight
- shortest path
- graph matching
- bipartite graph
- graph theory
- connected subgraphs
- weighted graph
- graph structure
- graph databases
- average degree
- database language
- subgraph isomorphism
- graph mining
- spanning tree
- minimum cost
- series parallel
- graph structures
- vertex set
- graph representation
- similarity measure