Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let denote the intersection graph of A graph H is...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2020-10-01
|
| coleção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1080/09728600.2020.1832854 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|