| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653146 | Electronic Notes in Discrete Mathematics | 2006 | 8 Pages |
Abstract
We consider the squares of intersection graphs of hypergraphs and simple graphs. The Berge-type characterization for squares of intersection graphs of hypergraphs is obtained. The analogue of Whitney theorem for squares of intersection graphs of trees is proved. Using the connection between induced matchings of graph and independent sets of square of line graph, new polynomial solvable cases for the weighted induced matching problem are obtained.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
