Pages that link to "Item:Q4312248"

The following pages link to A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (Q4312248):

Displaying 40 items.

• Well-covered triangulations. IV (Q323041) (← links)
• Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
• Weighted well-covered claw-free graphs (Q482209) (← links)
• Triangulations and equality in the domination chain (Q494427) (← links)
• On well-covered pentagonalizations of the plane (Q526819) (← links)
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
• Complexity results for generating subgraphs (Q724239) (← links)
• The well-covered dimension of random graphs (Q864120) (← links)
• Well-covered graphs and extendability (Q1318795) (← links)
• A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267) (← links)
• Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
• A characterization of well-covered graphs in terms of forbidden costable subgraphs (Q1581458) (← links)
• Equimatchable claw-free graphs (Q1660273) (← links)
• On vertex decomposable and Cohen-Macaulay regular graphs (Q1755493) (← links)
• On well-covered Cartesian products (Q1756093) (← links)
• On 4-connected claw-free well-covered graphs (Q1917239) (← links)
• Weighted well-covered graphs without cycles of lengths 5, 6 and 7 (Q2059877) (← links)
• Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
• Unmixedness of some weighted oriented graphs (Q2114794) (← links)
• On well-covered direct products (Q2118250) (← links)
• \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs (Q2158192) (← 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)
• On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
• Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
• Well-dominated graphs without cycles of lengths 4 and 5 (Q2397523) (← links)
• Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
• On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
• Well-covered graphs and factors (Q2492219) (← links)
• The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
• On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
• Complexity results for well‐covered graphs (Q3993632) (← links)
• (Q4622618) (← links)
• A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
• Cohen–Macaulay graphs with large girth (Q5255732) (← links)
• Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
• Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
• Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
• Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)
• Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)