Zobrazeno 1 - 1
of 1
pro vyhledávání: '"David J. Mendell"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science. 17
Let G denote a multigraph with edge set E(G), let µ(G) denote the maximum edge multiplicity in G, and let Pk denote the path on k vertices. Heinrich et al.(1999) showed that P4 decomposes a connected 4-regular graph G if and only if |E(G)| is divisi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::962571f300ffd12870bcb1e84939c9da
https://doi.org/10.46298/dmtcs.2128
https://doi.org/10.46298/dmtcs.2128
