Deciding k-colourability of P_5-free graphs in polynomial time
Chính T. HoàngMarcin KaminskiVadim V. LozinJoe SawadaXiao ShuPublished in: CoRR (2007)
Keyphrases
- graph isomorphism
- polynomial time complexity
- special case
- bounded treewidth
- planar graphs
- worst case
- np complete
- graph matching
- graph theory
- graph databases
- graph representation
- spanning tree
- np hardness
- database
- pattern recognition
- graph theoretic
- graph clustering
- finite automata
- graph structures
- approximation algorithms
- subgraph isomorphism
- directed graph
- upper bound
- structured objects
- computational complexity