Edge-reconstruction of planar graphs with minimum valency 5

Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/112086

Full metadata record

DC Field	Value	Language
dc.contributor.author	Lauri, Josef	-
dc.date.accessioned	2023-07-27T10:52:32Z	-
dc.date.available	2023-07-27T10:52:32Z	-
dc.date.issued	1979	-
dc.identifier.citation	Lauri, J. (1979). Edge‐reconstruction of planar graphs with minimum valency 5. Journal of Graph Theory, 3(3), 269-286.	en_GB
dc.identifier.uri	https://www.um.edu.mt/library/oar/handle/123456789/112086	-
dc.description.abstract	The object of this paper is to show that every planar graph of minimum valency 5 is reconstructible from its family of edge-deleted subgraphs.	en_GB
dc.language.iso	en	en_GB
dc.publisher	John Wiley & Sons Ltd	en_GB
dc.rights	info:eu-repo/semantics/restrictedAccess	en_GB
dc.subject	Graph theory	en_GB
dc.subject	Graphic methods	en_GB
dc.subject	Mathematics -- Charts, diagrams, etc.	en_GB
dc.title	Edge-reconstruction of planar graphs with minimum valency 5	en_GB
dc.type	article	en_GB
dc.rights.holder	The 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.reviewed	peer-reviewed	en_GB
dc.publication.title	Journal of Graph Theory	en_GB
Appears in Collections:	Scholarly Works - FacSciMat

Files in This Item:

File	Description	Size	Format
Edge_reconstruction_of_planar_graphs_with_minimum_valency_5_1979.pdf Restricted Access		248.76 kB	Adobe PDF	View/Open Request a copy