Colouring Graphs with No Induced Six-Vertex Path or Diamond.
Jan GoedgebeurShenwei HuangYiao JuOwen D. MerkelPublished in: COCOON (2021)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- edge weights
- maximum cardinality
- strongly connected
- shortest path
- connected subgraphs
- graph theoretic
- betweenness centrality
- hamiltonian cycle
- graph matching
- minimum weight
- graph structure
- weighted graph
- endpoints
- spanning tree
- vertex set
- minimum length
- graph theory
- neural network
- minimum cost
- series parallel
- image sequences
- optimal path
- graph partitioning
- social networks
- approximation algorithms
- graph databases
- bipartite graph