A characterisation of well-covered cubic graphs. Recent progress in edge reconstruction. Isomorphic factorization of regular graphs of even degree. Isomorphic factorization of regular graphs and 3-regular multigraphs. Isomorphic factorization of r -regular graphs into r parts.
Bidegreed graphs are edge reconstructible.
Uniqueness of impartial edge-colourings. Legitimate number decks for trees. Cycles through ten vertices in 3-connected cubic graphs. Petersen subdivisions in some regular graphs. 3-connected cubic bipartite graphs.