Nonseparating K4-subdivisions in graphs of minimum degree at least 4.

Matthias Kriesell

Published in: J. Graph Theory (2018)

Keyphrases

random graphs
graph theory
spanning tree
graph matching
minimum cost
graph representation
graph isomorphism
image segmentation
graph construction
graph theoretic
weighted graph
graph databases
graph clustering
bipartite graph
adjacency matrix
maximal cliques
structured objects
directed graph