Buscar
Mostrando ítems 1-10 de 1919
Covergence and divergence of the iterated biclique graph
(Wiley, 2013-06)
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G, denoted by KB(G), is the intersection graph of the bicliques of G. We say that a graph G diverges (or converges or is ...
On some graph classes related to perfect graphs: A survey
(Elsevier, 2020)
Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min-max type equality involving two famous graph parameters. In this work, we survey certain variants and subclasses of perfect ...
On some graph classes related to perfect graphs: A survey
(Elsevier B.V., 2020)
© 2019 Elsevier B.V.Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min–max type equality involving two famous graph parameters. In this work, we survey certain variants and ...
On second iterated clique graphs that are also third iterated clique graphs
(Elsevier, 2015-12)
Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task. The fact that being a clique ...
On basic chordal graphs and some of its subclasses
(Elsevier Science, 2016-09)
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its ...
The Images of the Clique Operator and Its Square are Different
(John Wiley & Sons Inc, 2014-09)
LetGbe the class of all graphs andKbe the clique operator.The validity of the equalityK(G)=K2(G)has been an open question forseveral years. A graph inK(G)but not inK2(G)is exhibited here.
On some graph classes related to perfect graphs: A survey
(Elsevier Science, 2020-07-15)
Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min–max type equality involving two famous graph parameters. In this work, we survey certain variants and subclasses of perfect ...
The difference between clique graphs and iterated clique graphs
(Elsevier, 2011)
The clique operator on circular-arc graphs
(Elsevier Science, 2010-06)
A circular-arc graphG is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is ...