Circular edge-colorings of cubic graphs with girth six.
Daniel KrálEdita MácajováJán MazákJean-Sébastien SereniPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- graph matching
- edge information
- minimum spanning trees
- vertex set
- graph theoretic
- directed graph
- spanning tree
- graph theory
- edge weights
- multiple scales
- graph coloring
- graph mining
- graph databases
- random walk
- strongly connected
- adjacency graph
- multiscale
- graph representation
- random graphs
- graph kernels
- series parallel
- edge detector
- constraint satisfaction problems