Home » configure

fhavet

TypePostAuthorRepliesLast post
categoryMcDiarmid, Colin fhavet011 years 38 weeks ago
Open problemWeighted colouring of hexagonal graphs. fhavet011 years 38 weeks ago
Open problemColouring the square of a planar graph fhavet011 years 38 weeks ago
categoryWegner fhavet011 years 38 weeks ago
Open problemList chromatic number and maximum degree of bipartite graphs fhavet011 years 38 weeks ago
Open problemHamilton decomposition of prisms over 3-connected cubic planar graphs fhavet011 years 38 weeks ago
Open problemTurán's problem for hypergraphs fhavet011 years 38 weeks ago
Open problem4-connected graphs are not uniquely hamiltonian fhavet011 years 38 weeks ago
categoryFleischner, Herbert fhavet011 years 38 weeks ago
categoryKrál, Daniel fhavet011 years 38 weeks ago
categoryRyjácek, Zdenek fhavet011 years 38 weeks ago
categoryVoss, Heinz-Jürgen fhavet011 years 38 weeks ago
Open problemEvery prism over a 3-connected planar graph is hamiltonian. fhavet011 years 38 weeks ago
categoryKaiser, Tomás fhavet011 years 38 weeks ago
Open problemHoàng-Reed Conjecture fhavet011 years 38 weeks ago
Open problemEdge-disjoint Hamilton cycles in highly strongly connected tournaments. fhavet011 years 39 weeks ago
Open problemHamilton cycle in small d-diregular graphs fhavet011 years 39 weeks ago
categoryMader, W. fhavet011 years 39 weeks ago
Open problemSwitching reconstruction of digraphs fhavet011 years 39 weeks ago
categoryBondy, J. Adrian fhavet011 years 39 weeks ago
categoryMercier, Fabien fhavet011 years 39 weeks ago
Open problemSwitching reconstruction conjecture fhavet011 years 39 weeks ago
categoryNash-Williams, Crispin, St. J. A. fhavet011 years 39 weeks ago
Open problemEvery 4-connected toroidal graph has a Hamilton cycle fhavet011 years 39 weeks ago
categoryFon-Der-Flasss, D. G. fhavet011 years 39 weeks ago