Abstract
A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Caro, Y., Sebő, A., Tarsi, M.: Recognizing greedy structures. Journal of Algorithms 20, 137–156 (1996)
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)
Tankus, D., Tarsi, M.: Well-covered claw-free graphs. Journal of Combinatorial Theory Ser. B 66, 293–302 (1996)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Levit, V.E., Tankus, D. (2009). On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds) Graph Theory, Computational Intelligence and Thought. Lecture Notes in Computer Science, vol 5420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02029-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-02029-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02028-5
Online ISBN: 978-3-642-02029-2
eBook Packages: Computer ScienceComputer Science (R0)