Acyclic 4-edge colouring of non-regular subcubic graphs in linear time.
Robert Lukot'kaPublished in: Discret. Appl. Math. (2014)
Keyphrases
- weighted graph
- undirected graph
- edge information
- connected graphs
- graph theoretic
- graph representation
- minimum spanning trees
- worst case
- edge detection
- strongly connected
- np hard
- edge weights
- database schemes
- graph clustering
- graph matching
- bipartite graph
- subgraph isomorphism
- graph mining
- graph model
- image processing
- graph theory
- data structure
- graph partitioning
- edge detector
- random graphs
- shortest path
- np complete
- data model
- multiscale