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

Vadim E. Levit, David Tankus. On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. In Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell, editors, Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Volume 5420 of Lecture Notes in Computer Science, pages 144-147, Springer, 2009. [doi]

@inproceedings{LevitT09,
  title = {On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6},
  author = {Vadim E. Levit and David Tankus},
  year = {2009},
  doi = {10.1007/978-3-642-02029-2_14},
  url = {http://dx.doi.org/10.1007/978-3-642-02029-2_14},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/LevitT09},
  cites = {0},
  citedby = {0},
  pages = {144-147},
  booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday},
  editor = {Marina Lipshteyn and Vadim E. Levit and Ross M. McConnell},
  volume = {5420},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-02028-5},
}