Nonseparating independent sets and maximum genus of graphs

DOI10.1007/s10255-022-1111-7zbMath1493.05240WikidataQ114228091 ScholiaQ114228091MaRDI QIDQ2155662

Han Ren, Chao Yang, Er-ling Wei

Publication date: 15 July 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1111-7

zbMATH Keywords

maximum genus; graph embedding; decycling set; nonseparating independent sets

Mathematics Subject Classification ID

05C38: Paths and cycles

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C07: Vertex degrees

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)