Graphs of degree 4 are 5-edge-choosable.
Martin JuvanBojan MoharRiste SkrekovskiPublished in: J. Graph Theory (1999)
Keyphrases
- weighted graph
- undirected graph
- random graphs
- graph matching
- edge information
- graph theory
- edge detection
- graph theoretic
- graph model
- series parallel
- graph representation
- minimum spanning trees
- social networks
- vertex set
- graph clustering
- power law
- graph partitioning
- graph mining
- bipartite graph
- image segmentation
- case study