Line greatest common variation subgraphs of trees (Q2716632)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Line greatest common variation subgraphs of trees |
scientific article; zbMATH DE number 1599242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Line greatest common variation subgraphs of trees |
scientific article; zbMATH DE number 1599242 |
Statements
28 November 2001
0 references
tree
0 references
common subgraph
0 references
line graph
0 references
Line greatest common variation subgraphs of trees (English)
0 references
A line greatest common subgraph (LineGCS) of two graphs, \(G_1\) and \(G_2\), is defined to be a graph \(G\) such that \(L(G)\) is the line graph of a \(\text{GCS}(G_1,G_2)\) and also a \(\text{GCS}(L(G_1),L(G_2))\). This notion is expanded to variation subgraphs such as induced subgraphs, connected subgraphs, and subgraphs that are both induced and connected. Theorems are presented as counterparts to those proven previously for LineGCS by the authors [Congr. Numerantium 128, 151-160 (1997; Zbl 0898.05065) and Congr. Numerantium 140, 65-86 (1999; Zbl 0960.05037)].
0 references
