Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Sources and sinks in comparability graphs|
|Abstract:||We prove that a subset S of vertices of a comparability graph G is a source set if and only if each vertex of S is a source and there is no odd induced path in G between two vertices of S. We also characterize pairs of subsets corresponding to sources and sinks, respectively. Finally, an application to interval graphs is obtained.|
|Editor:||Kluwer Academic Publ|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.