Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable.
Andrew ThomasonPublished in: J. Graph Theory (1982)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge detection
- graph theory
- edge weights
- b spline
- graph representation
- data sets
- vertex set
- edge detector
- graph matching
- graph structure
- graph clustering
- graph partitioning
- edge information
- subgraph isomorphism
- random graphs
- graph theoretic
- data mining
- graph databases
- clustering algorithm
- image processing
- bipartite graph
- graphical models
- scheduling problem