Weakly completable critical sets for proper vertex and edge colourings of graphs.
David R. B. BurgessA. Donald KeedwellPublished in: Australas. J Comb. (2001)
Keyphrases
- undirected graph
- vertex set
- weighted graph
- edge weights
- directed graph
- attributed graphs
- spanning tree
- labeled graphs
- minimum weight
- approximation algorithms
- connected components
- strongly connected
- random graphs
- edge information
- minimum spanning trees
- directed acyclic graph
- complex networks
- edge detection
- graph mining
- graph theoretic
- graph matching
- adjacency graph
- hamiltonian cycle
- average degree
- data structure
- graph theory
- hough transform
- shortest path
- object recognition
- pattern recognition