Connected graphs containing a given connected graph as a unique greatest common subgraph
A greatest common subgraph of two nonisomorphic graphs \(G_ 1\) and \(G_ 2\) of equal size is any graph of maximum size without isolated vertices that is a subgraph of both \(G_ 1\) and \(G_ 2\), see i.e. \textit{G. Chartrand, F. Saba} and \textit{H. Zou} [Čas. Pěstování Mat. 110, 87-91 (1985; Zbl 0567.05044)]. Here the authors determine those connected graphs G for which there exist nonisomorphic connected graphs of equal size with G as a unique greatest common subgraph. Analogous results are proved for induced subgraphs and subdigraphs.
- Greatest common subgroups with specified properties
- Line greatest common variation subgraphs of trees
- scientific article; zbMATH DE number 4135991 (Why is no real title available?)
- scientific article; zbMATH DE number 15858 (Why is no real title available?)
- scientific article; zbMATH DE number 19196 (Why is no real title available?)
- scientific article; zbMATH DE number 1161357 (Why is no real title available?)
- The word and geodesic problems in free solvable groups.
- Planar graphs and greatest common subgraphs
This page was built for publication: Connected graphs containing a given connected graph as a unique greatest common subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087564)
