Line greatest common variation subgraphs of trees

MaRDI QIDQ2716632zbMATH OpenFDO

Authors Kathleen Cherry, Robert Brigham

Publication date 28 November 2001

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

common subgraphline graphtree

Mathematics Subject Classification ID

Trees (05C05)

Review text

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)].

Recommendations

• scientific article; zbMATH DE number 1161388
• scientific article; zbMATH DE number 1439439
• scientific article; zbMATH DE number 4145922
• scientific article; zbMATH DE number 15858
• Connected graphs containing a given connected graph as a unique greatest common subgraph

Cited in

(3)

• scientific article; zbMATH DE number 4145922 (Why is no real title available?)
• scientific article; zbMATH DE number 1161388 (Why is no real title available?)
• scientific article; zbMATH DE number 1439439 (Why is no real title available?)

This page was built for publication: Line greatest common variation subgraphs of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716632)