On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6

1. Brown, J.I., Nowakowski, R.J., Zverovich, I.E.: The structure of well-covered graphs with no cycles of length 4. Discrete Mathematics 307, 2235–2245 (2007)

   Article  MathSciNet  MATH  Google Scholar 

2. Caro, Y., Ellingham, N., Ramey, G.F.: Local structure when all maximal independent sets have equal weight. SIAM Journal on Discrete Mathematics 11, 644–654 (1998)

   Article  MathSciNet  MATH  Google Scholar 

3. Caro, Y., Sebő, A., Tarsi, M.: Recognizing greedy structures. Journal of Algorithms 20, 137–156 (1996)

   Article  MathSciNet  MATH  Google Scholar 

4. Finbow, A., Hartnell, B., Nowakowski, R.: A characterization of well-covered graphs of girth 5 or greater. Journal of Combinatorial Theory Ser. B 57, 44–68 (1993)

   Article  MathSciNet  MATH  Google Scholar 

5. Tankus, D., Tarsi, M.: Well-covered claw-free graphs. Journal of Combinatorial Theory Ser. B 66, 293–302 (1996)

   Article  MathSciNet  MATH  Google Scholar 

6. Tankus, D., Tarsi, M.: The structure of well-covered graphs and the complexity of their recognition problems. Journal of Combinatorial Theory Ser. B 69, 230–233 (1997)

   Article  MathSciNet  MATH  Google Scholar 

Download references