Idioma:

Minor-Obstructions for Apex-Pseudoforests

Leivaditis, Alexandros ; Singh, Alexandros ; Stamoulis, Giannos ; Thilikos, Dimitrios M ; Tsatsanis, Konstantinos

arXiv.org, 2022-09

Texto completo disponível

Citações Citado por

Título:
Minor-Obstructions for Apex-Pseudoforests
Autor: Leivaditis, Alexandros ; Singh, Alexandros ; Stamoulis, Giannos ; Thilikos, Dimitrios M ; Tsatsanis, Konstantinos
Assuntos: Apexes ; Graphs ; Mathematics - Combinatorics ; Obstructions
É parte de: arXiv.org, 2022-09
Descrição: A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the minor-obstruction set of the class of apex-pseudoforests, i.e., the set of all minor-minimal graphs that are not apex-pseudoforests.
Editor: Ithaca: Cornell University Library, arXiv.org
Idioma: Inglês

Links

Voltar para lista de resultados