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

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 Car...

Full description

Bibliographic Details
Main Authors: Zdeněk Ryjáček, Carol T. Zamfirescu
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2010-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol30/4/art/opuscula_math_3039.pdf
id doaj-f33fd2ff80b14d8ca0e9d52623bf7088
record_format Article
spelling doaj-f33fd2ff80b14d8ca0e9d52623bf70882020-11-25T00:49:08ZengAGH Univeristy of Science and Technology PressOpuscula Mathematica1232-92742010-01-01304527532http://dx.doi.org/10.7494/OpMath.2010.30.4.5273039Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)Zdeněk Ryjáček0Carol T. Zamfirescu1University of West Bohemia, Department of Mathematics, Czech RepublicTechnische Universität Dortmund, Vogelpothsweg 87, 44221 Dortmund, GermanyA 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”.http://www.opuscula.agh.edu.pl/vol30/4/art/opuscula_math_3039.pdfHamilton-connected graphhamiltonian graphdominating cyclebihomogeneously traceble graph
collection DOAJ
language English
format Article
sources DOAJ
author Zdeněk Ryjáček
Carol T. Zamfirescu
spellingShingle Zdeněk Ryjáček
Carol T. Zamfirescu
Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
Opuscula Mathematica
Hamilton-connected graph
hamiltonian graph
dominating cycle
bihomogeneously traceble graph
author_facet Zdeněk Ryjáček
Carol T. Zamfirescu
author_sort Zdeněk Ryjáček
title Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
title_short Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
title_full Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
title_fullStr Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
title_full_unstemmed Research problems from the 18th workshop ‘3in1’ 2009 (edited by Mariusz Meszka)
title_sort research problems from the 18th workshop ‘3in1’ 2009 (edited by mariusz meszka)
publisher AGH Univeristy of Science and Technology Press
series Opuscula Mathematica
issn 1232-9274
publishDate 2010-01-01
description 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”.
topic Hamilton-connected graph
hamiltonian graph
dominating cycle
bihomogeneously traceble graph
url http://www.opuscula.agh.edu.pl/vol30/4/art/opuscula_math_3039.pdf
work_keys_str_mv AT zdenekryjacek researchproblemsfromthe18thworkshop3in12009editedbymariuszmeszka
AT caroltzamfirescu researchproblemsfromthe18thworkshop3in12009editedbymariuszmeszka
_version_ 1725252795462844416