Balancedness of subclasses of circular-arc graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

Balancedness of subclasses of circular-arc graphs


A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.
Fichier principal
Vignette du fichier
dmtcs-16-3-1.pdf (423.93 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01188914 , version 1 (31-08-2015)



Flavia Bonomo, Guillermo Duran, Martin D. Safe, Annegret K. Wagler. Balancedness of subclasses of circular-arc graphs. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 3 (3), pp.1--22. ⟨10.46298/dmtcs.2100⟩. ⟨hal-01188914⟩
153 View
765 Download



Gmail Facebook Twitter LinkedIn More