Partial characterizations of circular-arc graphs

Mostrar todas las versiones(2)

A circular-arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular-arc graphs by a list of minimal forbidden...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Durán, Guillermo A., Grippo, Luciano Norberto, Safe, Martín Darío
Publicado: 2009
Materias:
Circular-arc graphs
Claw-free chordal graphs
Cographs
Diamond-free graphs
Paw-free graphs
Chordal graphs
Circular-arc graph
Claw-free
Forbidden induced subgraphs
Free graphs
Intersection graph
Partial characterization
Characterization
Diamonds
Cavity resonators
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03649024_v61_n4_p289_Bonomo
http://hdl.handle.net/20.500.12110/paper_03649024_v61_n4_p289_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares