Código QR (código de barras bidimensional)

Homotopy covers of graphs

<p><span>We develop a theory of ×-homotopy, fundamental groupoids and covering spaces that applies to non-simple graphs, generalizing existing results for simple graphs. We prove that ×-homotopies from finite graphs can be decomposed into moves that adjust at most one vertex at a time, generalizing...

תיאור מלא

שמור ב:
Principais autores: Tien Chih, Laura Scull
פורמט: Artigo
שפה:Inglês
יצא לאור: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2026-04-01
סדרה:Electronic Journal of Graph Theory and Applications
נושאים:
discrete homotopy
graph covers
groupoids
$\times$-homotopy
גישה מקוונת:http://www.ejgta.org/index.php/ejgta/article/view/2107
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים