The strong chromatic index of a cubic graph is at most 10.
Lars Døvling AndersenPublished in: Discret. Math. (1992)
Keyphrases
- graph model
- structured data
- directed graph
- database
- graph representation
- structural similarity
- graph theory
- graph structure
- random walk
- b spline
- graph databases
- stable set
- random graphs
- graph partitioning
- graph mining
- weighted graph
- bipartite graph
- graph matching
- index structure
- spanning tree
- undirected graph
- semi supervised
- np hard
- information retrieval
- graph construction
- query graph
- data sets