Metric characterizations of proper interval graphs and tree-clique graphs : Notas de Matemática, 54

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When T is a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gutiérrez, Marisa, Oubiña, Lía
Formato: Publicacion seriada
Lenguaje:Inglés
Publicado: 1994
Materias:
Matemática
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/170672
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares