Back to Search
Start Over
Squares of Intersection Graphs and Induced Matchings.
- Source :
- Electronic Notes in Discrete Mathematics; Jul2006, Vol. 24, p223-230, 8p
- Publication Year :
- 2006
-
Abstract
- 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. [Copyright &y& Elsevier]
- Subjects :
- GRAPH theory
GRAPHIC methods
GEOMETRICAL drawing
FLOWGRAPHS
Subjects
Details
- Language :
- English
- ISSN :
- 15710653
- Volume :
- 24
- Database :
- Supplemental Index
- Journal :
- Electronic Notes in Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 21610830
- Full Text :
- https://doi.org/10.1016/j.endm.2006.06.033