The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable.
Dmitriy S. MalyshevPublished in: Optim. Lett. (2021)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- connected subgraphs
- maximum cardinality
- hamiltonian cycle
- graph theoretic
- bipartite graph
- edge weights
- graph clustering
- graph matching
- graph partitioning
- graph representation
- data sets
- graph theory
- average degree
- pattern recognition
- graph mining
- weighted graph
- strongly connected
- vertex set
- structured objects
- bayesian networks