Home » configure

fhavet

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