Disimplicial arcs, transitive vertices, and disimplicial eliminations

In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A diclique of a digraph is a pair V → W of sets of vertices such that v → w is an arc for every v ∈ V and w ∈ W. An arc v → w is disimpli...

Descripción completa

Detalles Bibliográficos
Autores principales: Eguía, M., Soulignac, F.J.
Formato: JOUR
Materias:
Bisimplicial edges of bipartite graphs
Bisimplicial elimination schemes
Dedekind digraphs
Diclique irreducible digraphs
Disimplicial arcs
Disimplicial elimination schemes
Transitive digraphs
Algorithms
Directed graphs
Set theory
Bipartite graphs
Elimination scheme
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_14627264_v17_n2_p101_Eguia
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares