Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture.
Guillaume ChapuyGuillem PerarnauPublished in: J. Comb. Theory, Ser. B (2019)
Keyphrases
- connected components
- random walk
- graph connectivity
- graph representation
- bipartite graph
- strongly connected
- topological information
- structured data
- graph clustering
- graph model
- graph theory
- equivalence classes
- directed acyclic graph
- data sets
- directed graph
- class labels
- training data
- neural network
- graph theoretic
- minimum spanning tree
- binary images
- genetic algorithm