Maximum average degree of list-edge-critical graphs and Vizing's conjecture.
Joshua HarrelsonHannah ReavisPublished in: Electron. J. Graph Theory Appl. (2022)
Keyphrases
- average degree
- undirected graph
- phase transition
- network size
- random walk
- small world networks
- directed graph
- approximation algorithms
- weighted graph
- complex networks
- spanning tree
- graph structure
- small world
- minimum cost
- special case
- np complete
- graph representation
- network structure
- constraint satisfaction problems