Home » configure

fhavet

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