Balancedness of some subclasses of circular-arc graphs

A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circul...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Safe, M.D., Wagler, A.K.
Formato: JOUR
Materias:
Balanced graphs
Circular-arc graphs
Forbidden subgraphs
Perfect graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710653_v36_nC_p1121_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares