On spanning trees and cycles of multicolored point sets with few intersections M. Kano∗, C. Merino†§, and J. Urrutia†‡ April 10, 2003 Abstract

Source URL: gorogoro.cis.ibaraki.ac.jp

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

Source URL: www.zaik.uni-koeln.de

• NP-complete problems
• Graph
• Graph theory
• Matching
• Cycle
• Hamiltonian path
• Spanning tree

Efficiently Searching for Frustrated Cycles in MAP Inference David Sontag, Do Kook Choe, Yitao Li Department of Computer Science Courant Institute of Mathematical Sciences New York University

Source URL: cs.nyu.edu

Long paths and cycles in hypercubes with faulty vertices Jiˇr´ı Fink ∗ Department of Applied Mathematics Faculty of Mathematics and Physics Charles University

Source URL: iti.mff.cuni.cz

Min-max relations for odd cycles in planar graphs∗ Daniel Kr´al’† Jean-S´ebastien Sereni‡ Ladislav Stacho§

Source URL: iti.mff.cuni.cz

Nuclear Development Accelerator-driven Systems (ADS) and Fast Reactors (FR) in Advanced Nuclear Fuel Cycles

Source URL: www.oecd-nea.org

Hamiltonian Cycles in Sparse Vertex-Adjacency Duals Perouz Taslakian and Godfried Toussaint School of Computer Science McGill University Montr´eal, Qu´ebec, Canada {perouz, godfried}@cs.mcgill.ca

Source URL: homepages.ulb.ac.be

COLORED GRAPHS WITHOUT COLORFUL CYCLES ˇ PULTR, AND PETR VOJTECHOVSK ˇ ´ RICHARD N. BALL, ALES Y

Source URL: iti.mff.cuni.cz

Long cycles in fullerene graphs Daniel Kr´al’a∗ a b

Source URL: iti.mff.cuni.cz

Programme Monday, September 7 Early morning session • Kenta Ozeki, Tokyo, Hamiltonicity of graphs on surfaces • Nico Van Cleemput, Ghent, On the number of hamiltonian cycles in triangulations with few separating tria

Source URL: umv.science.upjs.sk