Colouring graphs with no induced six-vertex path or diamond.
Jan GoedgebeurShenwei HuangYiao JuOwen D. MerkelPublished in: CoRR (2021)
Keyphrases
- directed graph
- undirected graph
- edge weights
- attributed graphs
- labeled graphs
- hamiltonian cycle
- shortest path
- strongly connected
- graph matching
- bipartite graph
- vertex set
- graph clustering
- graph structure
- connected subgraphs
- graph theory
- graph representation
- optimal path
- pattern recognition
- average degree
- maximum cardinality
- finding the shortest path
- minimum weight
- series parallel
- graph structures
- graph theoretic
- graph partitioning
- graph mining
- endpoints
- weighted graph
- approximation algorithms
- traveling salesman problem