The following pages link to Some covering concepts in graphs (Q5591382):
Displaying 50 items.
- A class of graphs with a few well-covered members (Q2041119) (← 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)
- On well-covered direct products (Q2118250) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
- Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
- Badly-covered graphs (Q2255048) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← 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)
- On graphs having maximal independent sets of exactly \(t\) distinct cardinalities (Q2376089) (← links)
- Reconfiguring dominating sets in some well-covered and other classes of graphs (Q2397524) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (Q2481813) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture (Q2493111) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
- On well-dominated graphs (Q2657074) (← links)
- Jet graphs (Q2668134) (← links)
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra (Q2671741) (← links)
- On \(\alpha\)-excellent graphs (Q2683166) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Modeling \(k\)-coteries by well-covered graphs (Q2766106) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- (Q4622618) (← links)
- A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
- Unimodality of the independence polynomials of some composite graphs (Q5005855) (← links)
- (Q5026974) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
- The independence and independent dominating numbers of the total graph of a finite commutative ring (Q5060199) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- (Q5149984) (← links)
- Cohen–Macaulay graphs with large girth (Q5255732) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
