2000 character limit reached
2-switch transition on unicyclic graphs and pseudoforest
Published 28 Feb 2021 in math.CO | (2103.00618v1)
Abstract: In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also unicyclic graphs (pseudoforests).
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.