Colouring graphs with no induced six-vertex path or diamond.
Jan GoedgebeurShenwei HuangYiao JuOwen D. MerkelPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- attributed graphs
- edge weights
- hamiltonian cycle
- shortest path
- strongly connected
- vertex set
- graph matching
- weighted graph
- betweenness centrality
- bipartite graph
- connected subgraphs
- maximum cardinality
- average degree
- finding the shortest path
- optimal path
- graph theoretic
- graph databases
- minimum cost
- graph theory
- minimum weight
- spanning tree
- approximation algorithms
- connected components
- random walk