1 Ocak 2011 Dergi makalesi Açık Erişim

Wiener, Gabor; Araya, Makoto

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Wiener, Gabor</dc:creator>
  <dc:creator>Araya, Makoto</dc:creator>
  <dc:date>2011-01-01</dc:date>
  <dc:description>We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for every integer n &gt;= N there exists a planar hypohamiltonian/hypotraceable graph on n vertices. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 67: 55-68, 2011</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/21823</dc:identifier>
  <dc:identifier>oai:zenodo.org:21823</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>JOURNAL OF GRAPH THEORY 67(1) 55-68</dc:source>
  <dc:title>On Planar Hypohamiltonian Graphs</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>