Dergi makalesi Açık Erişim
Wiener, Gabor; Araya, Makoto
<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
<leader>00000nam##2200000uu#4500</leader>
<datafield tag="909" ind1="C" ind2="O">
<subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
<subfield code="o">oai:zenodo.org:21823</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">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</subfield>
</datafield>
<datafield tag="980" ind1=" " ind2=" ">
<subfield code="a">publication</subfield>
<subfield code="b">article</subfield>
</datafield>
<datafield tag="540" ind1=" " ind2=" ">
<subfield code="a">Creative Commons Attribution</subfield>
<subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
</datafield>
<datafield tag="100" ind1=" " ind2=" ">
<subfield code="a">Wiener, Gabor</subfield>
<subfield code="u">Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, H-1117 Budapest, Hungary</subfield>
</datafield>
<datafield tag="856" ind1="4" ind2=" ">
<subfield code="z">md5:b025e8be5fa6785b73f4b8053ac1a7cd</subfield>
<subfield code="s">103</subfield>
<subfield code="u">https://aperta.ulakbim.gov.trrecord/21823/files/bib-dc8bab08-ac9f-45a1-b18f-b6f4b99f5670.txt</subfield>
</datafield>
<controlfield tag="005">20210315105407.0</controlfield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2011-01-01</subfield>
</datafield>
<datafield tag="024" ind1=" " ind2=" ">
<subfield code="a">10.1002/jgt.20513</subfield>
<subfield code="2">doi</subfield>
</datafield>
<datafield tag="542" ind1=" " ind2=" ">
<subfield code="l">open</subfield>
</datafield>
<datafield tag="245" ind1=" " ind2=" ">
<subfield code="a">On Planar Hypohamiltonian Graphs</subfield>
</datafield>
<datafield tag="909" ind1="C" ind2="4">
<subfield code="v">67</subfield>
<subfield code="p">JOURNAL OF GRAPH THEORY</subfield>
<subfield code="c">55-68</subfield>
<subfield code="n">1</subfield>
</datafield>
<datafield tag="650" ind1="1" ind2="7">
<subfield code="a">cc-by</subfield>
<subfield code="2">opendefinition.org</subfield>
</datafield>
<datafield tag="700" ind1=" " ind2=" ">
<subfield code="a">Araya, Makoto</subfield>
<subfield code="u">Shizuoka Univ, Dept Comp Sci, Hamamatsu, Shizuoka 4328011, Japan</subfield>
</datafield>
<controlfield tag="001">21823</controlfield>
<datafield tag="980" ind1=" " ind2=" ">
<subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
</datafield>
</record>
| Görüntülenme | 33 |
| İndirme | 7 |
| Veri hacmi | 721 Bytes |
| Tekil görüntülenme | 31 |
| Tekil indirme | 7 |