Between Proper and Strong Edge-Colorings of Subcubic Graphs.
Hervé HocquardDimitri LajouBorut LuzarPublished in: IWOCA (2020)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- minimum spanning trees
- directed graph
- graph matching
- graph structure
- graph mining
- edge detection
- graph theoretic
- edge information
- graph theory
- vertex set
- subgraph isomorphism
- graph coloring
- random graphs
- densely connected
- graph clustering
- graph partitioning
- graph model
- graph data
- graph construction
- spanning tree
- strongly connected
- connected components
- adjacency graph
- shortest path
- high level