Well covered simplicial, chordal, and circular arc graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199602)21:2<113::AID-JGT1>3.0.CO;2-U" /><113::AID-JGT1>3.0.CO;2-U 10.1002/(SICI)1097-0118(199602)21:2<113::AID-JGT1>3.0.CO;2-UzbMath0847.05062OpenAlexW4244891156MaRDI QIDQ4865520

Jerzy Topp, Preben Dahl Vestergaard, Erich Prisner

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<113::aid-jgt1>3.0.co;2-u

zbMATH Keywords

chordal graphindependent setsdomination numbercircular arc graphswell covered graphdomainting sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (34)

Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Well irredundant graphs ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ \(W_2\)-graphs and shedding vertices ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ On \(\alpha\)-excellent graphs ⋮ A characterization of well-dominated Cartesian products ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Graphs in which all maximal bipartite subgraphs have the same order ⋮ On relating edges in graphs without cycles of length 4 ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Weighted well-covered claw-free graphs ⋮ Complexity results for generating subgraphs ⋮ Shedding vertices of vertex decomposable well-covered graphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ 1-well-covered graphs revisited ⋮ Detecting strong cliques ⋮ Well-covered and Cohen-Macaulay theta-ring graphs ⋮ Mind the independence gap ⋮ Unnamed Item ⋮ The Clique Corona Operation and Greedoids ⋮ On well-dominated direct, Cartesian and strong product graphs ⋮ Cohen–Macaulay graphs with large girth ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Partitions and well-coveredness: the graph sandwich problem ⋮ Unmixedness of some weighted oriented graphs

This page was built for publication: Well covered simplicial, chordal, and circular arc graphs