Pages that link to "Item:Q4865520"

The following pages link to Well covered simplicial, chordal, and circular arc graphs (Q4865520):

Displaying 34 items.

• Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
• Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
• Weighted well-covered claw-free graphs (Q482209) (← links)
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
• Complexity results for generating subgraphs (Q724239) (← links)
• Mind the independence gap (Q776261) (← links)
• \(W_2\)-graphs and shedding vertices (Q1690016) (← links)
• Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
• Shedding vertices of vertex decomposable well-covered graphs (Q1800408) (← links)
• Well irredundant graphs (Q1917235) (← links)
• Weighted well-covered graphs without cycles of lengths 5, 6 and 7 (Q2059877) (← links)
• Well-covered and Cohen-Macaulay theta-ring graphs (Q2074402) (← links)
• On well-dominated direct, Cartesian and strong product graphs (Q2092407) (← links)
• Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
• Unmixedness of some weighted oriented graphs (Q2114794) (← links)
• On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
• Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 (Q2192076) (← links)
• Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
• 1-well-covered graphs revisited (Q2311371) (← links)
• Detecting strong cliques (Q2312812) (← links)
• Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
• Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
• Well-dominated graphs without cycles of lengths 4 and 5 (Q2397523) (← links)
• On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
• On \(\alpha\)-excellent graphs (Q2683166) (← links)
• On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
• (Q4622618) (← links)
• Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
• Cohen–Macaulay graphs with large girth (Q5255732) (← links)
• The Clique Corona Operation and Greedoids (Q5505676) (← links)
• Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
• Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
• A characterization of well-dominated Cartesian products (Q6124450) (← links)
• Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)