In this paper, we characterize well covered simplicial, chordal and circular arc graphs. 2. RESULTS. The following simple property of the well covered graphs ...

A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we characterize well covered ...

A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we characterize well covered ...

Well covered simplicial, chordal, and circular arc graphs. Authors. Prisner, Erich; Topp, Jerzy; Vestergaard, Preben Dahl. Publication. Journal of Graph Theory ...

Prisner, Erich ; Topp, Jerzy ; Vestergaard, Preben D. / Well covered simplicial, chordal, and circular arc graphs. In: Journal of Graph Theory. 1996 ; Vol. 21, ...

Erich Prisner, Jerzy Topp, Preben D. Vestergaard: Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory 21(2): 113-119 (1996).

Well covered simplicial, chordal, and circular arc graphs · Author Picture ... Metric characterizations of proper interval graphs and tree-clique graphs.

Sep 4, 2024 · Abstract. We identify all minimal chordal graphs that are not circular-arc graphs, thereby resolving one of “the main open problems” ...

Well covered simplicial, chordal, and circular arc graphs. Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jgt/PrisnerTV96. Home ...

In this work we characterize clique-perfect graphs by a restricted list of minimal forbidden induced subgraphs when the graph is a Helly circular-arc graph.