The class reconstruction number of maximal planar graphs
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Lauri, Josef | en_US |
dc.date.accessioned | 2006-09-08T19:24:53Z | |
dc.date.available | 2006-09-08T19:24:53Z | |
dc.date.issued | 1987-12 | en_US |
dc.identifier.citation | Harary, Frank; Lauri, Josef; (1987). "The class reconstruction number of maximal planar graphs." Graphs and Combinatorics 3(1): 45-53. <http://hdl.handle.net/2027.42/41581> | en_US |
dc.identifier.issn | 1435-5914 | en_US |
dc.identifier.issn | 0911-0119 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/41581 | |
dc.description.abstract | The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphs G i = G − v i in the deck of G which do not all appear in the deck of any other graph. For any graph theoretic property P , Harary defined the P -reconstruction number of a graph G ∈ P as the smallest number of the G i in the deck of G , which do not all appear in the deck of any other graph in P We now study the maximal planar graph reconstruction number ℳrn(G) , proving that its value is either 1 or 2 and characterizing those with value 1. | en_US |
dc.format.extent | 554943 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.subject.other | Engineering Design | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Mathematics | en_US |
dc.title | The class reconstruction number of maximal planar graphs | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | The University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | The University of Malta, Msida, Malta | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/41581/1/373_2005_Article_BF01788528.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01788528 | en_US |
dc.identifier.source | Graphs and Combinatorics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.