Coloring graphs with no induced five-vertex path or gem.
Maria ChudnovskyKarthick ThiyagarajanPeter MaceliFrédéric MaffrayPublished in: J. Graph Theory (2020)
Keyphrases
- directed graph
- edge weights
- attributed graphs
- undirected graph
- shortest path
- labeled graphs
- strongly connected
- hamiltonian cycle
- graph matching
- minimum weight
- minimum spanning tree
- graph theoretic
- spanning tree
- maximum cardinality
- graph structure
- graph theory
- average degree
- finding the shortest path
- minimum cost
- graph patterns
- random graphs
- graph representation
- graph model
- regular expressions
- betweenness centrality
- traveling salesman problem
- bayesian networks
- genetic algorithm