New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs.
Roland HäggkvistJeannette C. M. JanssenPublished in: Comb. Probab. Comput. (1997)
Keyphrases
- graph theory
- graph representation
- graph theoretic
- weighted graph
- directed graph
- graph structure
- graph structures
- graph classification
- bipartite graph
- graph partitioning
- labeled graphs
- graph matching
- graph mining
- graph databases
- upper bound
- graph theoretical
- random graphs
- minimum spanning tree
- edge weights
- random walk
- adjacency matrix
- structural pattern recognition
- reachability queries
- query graph
- lower bound
- spanning tree
- graph construction
- graph search
- worst case
- dynamic graph
- adjacency graph
- connected graphs
- finding the shortest path
- social networks
- graph drawing
- index structure
- structured data
- connected components
- graph representations
- subgraph isomorphism
- community discovery
- web graph