Graphs Whose Indecomposability Graph is 2-Covered

Rim Ben Hamadou, Imed Boudabbous. Graphs Whose Indecomposability Graph is 2-Covered. Multiple-Valued Logic and Soft Computing, 25(1):21-44, 2015. [doi]

@article{HamadouB15,
  title = {Graphs Whose Indecomposability Graph is 2-Covered},
  author = {Rim Ben Hamadou and Imed Boudabbous},
  year = {2015},
  url = {http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-25-number-1-2015/mvlsc-25-1-p-21-44/},
  researchr = {https://researchr.org/publication/HamadouB15},
  cites = {0},
  citedby = {0},
  journal = {Multiple-Valued Logic and Soft Computing},
  volume = {25},
  number = {1},
  pages = {21-44},
}