2 problems

0 votes0 replies0 views
Stanley's switching reconstruction conjecture
Stanley's switching reconstruction conjecture. For every $n>4$ , if two graphs on $n$ vertices have the same switching deck, then they are isomorphic.
Conjectureopengraph-theory reconstruction switching-classesarXiv posted 2 days ago
0 votes0 replies0 views
The switching-to-free-graph conjecture for paths and cycles of length six
Switching-to-free-graph conjecture. It is NP-complete to decide whether a graph can be switched to an $H$ -free graph.
Conjectureopencomputational-complexity graph-algorithms switching-classesarXiv posted 2 days ago

Stanley's switching reconstruction conjecture