Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Victor Neumann"'
Autor:
Victor Neumann-Lara, Richard G. Wilson
Publikováno v:
Order. 15:35-50
A topology on the vertex set of a comparability graph G is said to be compatible (respectively, weakly compatible) with G if each induced subgraph (respectively, each finite induced subgraph) is topologically connected if and only it it is graph-conn
Autor:
Victor Neumann-Lara, Simone Hazan
Publikováno v:
Order. 13:219-225
The fixed point property for partial orders has been the object of much attention in the past twenty years. Recently, M. Roddy ([7]) proved this famous conjecture of Rival (see [6]): the class of finite orders with the fixed point property is closed
Autor:
Richard G. Wilson, Victor Neumann-Lara
Publikováno v:
Order. 12:77-90
A topology on the vertex set of a graphG iscompatible with the graph if every induced subgraph ofG is connected if and only if its vertex set is topologically connected. In the case of locally finite graphs with a finite number of components, it was