Opuscula Mathematica
Opuscula Math. 30, no. 4 (), 527-532
Opuscula Mathematica

Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)

Abstract. A collection of open problems that were posed at the 18th Workshop ‘3in1’, held on November 26-28, 2009 in Krakow, Poland. The problems are presented by Zdenek Ryjacek in "Does the Thomassen's conjecture imply N=NP?" and "Dominating cycles and hamiltonian prisms", and by Carol T. Zamfirescu in "Two problems on bihomogeneously traceable digraphs".
Keywords: Hamilton-connected graph, hamiltonian graph, dominating cycle, bihomogeneously traceble graph.
Mathematics Subject Classification: 05C45, 68Q25, 05C38, 05C20.
Cite this article as:
Zdeněk Ryjáček, Carol T. Zamfirescu, Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka), Opuscula Math. 30, no. 4 (2010), 527-532, http://dx.doi.org/10.7494/OpMath.2010.30.4.527
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.