Well covered simplicial, chordal, and circular arc graphs

DOI10.1002/(SICI)1097-0118(199602)21:2%3C113::AID-JGT1%3E3.0.CO;2-UMaRDI QIDQ4865520zbMATH OpenOpenAlexFDO

Authors Erich Prisner, Jerzy Topp, Preben Dahl Vestergaard

Publication date 25 February 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C113::aid-jgt1%3E3.0.co;2-u

zbMATH Keywords

domination numberindependent setschordal graphcircular 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)

Recommendations

• Characterization of \(Z_m\)-well-covered graphs for some classes of graphs
• Strongly well-covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• scientific article; zbMATH DE number 1409193
• scientific article; zbMATH DE number 4202288

Cited in

(38)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865520)