Some polynomial subclasses of the Eulerian walk problem for a multiple graph

In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked edges...

Fuld beskrivelse

Bibliografiske detaljer

Hovedforfatter:	Alexander V. Smirnov
Format:	Artigo
Sprog:	Inglês
Udgivet:	Yaroslavl State University 2024-09-01
Serier:	Моделирование и анализ информационных систем
Fag:	multiple graph divisible graph covering trails edge-disjoint paths eulerian trail eulerian cycle graph with quasi-vertices ordinary edges reachability set polynomial subclass
Online adgang:	https://www.mais-journal.ru/jour/article/view/1881
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!