Opuscula Math. 30, no. 4 (2010), 527-532
http://dx.doi.org/10.7494/OpMath.2010.30.4.527

 
Opuscula Mathematica

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

Zdeněk Ryjáček
Carol T. Zamfirescu

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.

Full text (pdf)

  • Zdeněk Ryjáček
  • University of West Bohemia, Department of Mathematics, Czech Republic
  • Carol T. Zamfirescu
  • Technische Universität Dortmund, Vogelpothsweg 87, 44221 Dortmund, Germany
  • Received: 2009-11-28.
Opuscula Mathematica - cover

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.

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.