Self-clique Helly circular-arc graphs

Mostrar todas las versiones(3)

A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph. A circular-arc graph is the intersection graph of a family of arcs of a circle. A Helly circular...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bonomo, F.
Formato: Artículo publishedVersion
Publicado: 2006
Materias:
Helly circular-arc graphs
Self-clique graphs
Inclusions
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v306_n6_p595_Bonomo_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares