Truly non-trivial graphoidal graphs
A graphoidal cover of a graph G is a collection [Formula: see text] of non-trivial paths in G, which are not necessarily open, such that every vertex of G is an internal vertex of at most one path in [Formula: see text] and every edge of G is in exactly one path in [Formula: see text] If every path...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Taylor & Francis Group
2022-05-01
|
| Sarja: | AKCE International Journal of Graphs and Combinatorics |
| Aiheet: | |
| Linkit: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2077674 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|