Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/111813
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLauri, Josef-
dc.date.accessioned2023-07-18T11:12:20Z-
dc.date.available2023-07-18T11:12:20Z-
dc.date.issued1993-
dc.identifier.citationLauri, J. (1993). Endvertex-deleted subgraphs. Ars Combinatoria, 36, 171-182.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/111813-
dc.description.abstractWe consider two seemingly related problems. The first concerns pairs of graphs G and H containing end vertices (vertices of degree 1) and having the property that, although they are not isomorphic, they have the same collection of endvertex-deleted subgraphs. The second question concerns graphs G containing end vertices and having the property that, although no two endvertices are similar, any two endvertex-deleted subgraphs of G are isomorphic.en_GB
dc.language.isoenen_GB
dc.publisherCentre for Discrete Mathematics & Computingen_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectGraph theoryen_GB
dc.subjectGraphic methodsen_GB
dc.subjectMathematics -- Charts, diagrams, etc.en_GB
dc.titleEndvertex-deleted subgraphsen_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.description.reviewedpeer-revieweden_GB
dc.publication.titleArs Combinatoriaen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
Endvertex_deleted_subgraphs_1993.pdf
  Restricted Access
1.79 MBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.