Highly unbreakable graph with a fixed excluded minor are almost rigid.
Daniel LokshtanovMarcin PilipczukMichal PilipczukSaket SaurabhPublished in: CoRR (2022)
Keyphrases
- three dimensional
- graph structure
- random walk
- graph model
- directed graph
- graph theory
- bipartite graph
- data sets
- spanning tree
- connected components
- minimum spanning tree
- graph databases
- stable set
- graph based algorithm
- planar graphs
- graph search
- graph clustering
- equivalence classes
- graphical representation
- neural network