Partial Characterizations of Circular-Arc Graphs
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...
Guardado en:
Autores principales: | Bonomo, F., Durán, G., Grippo, L.N., Safe, M.D. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15710653_v30_nC_p45_Bonomo |
Aporte de: |
Ejemplares similares
-
Partial Characterizations of Circular-Arc Graphs
por: Bonomo, Flavia, et al.
Publicado: (2008) -
Partial characterizations of circular-arc graphs
por: Bonomo, F., et al. -
Partial characterizations of circular-arc graphs
por: Bonomo, Flavia, et al.
Publicado: (2009) -
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
por: Bonomo, Flavia, et al.
Publicado: (2009) -
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
por: Bonomo, F., et al.