Graphoidally independent infinite graphs
A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path in ψ, and (GC-2) every edge of G is in exactly...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2021.1953946 |