Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs (Q2552510)

For all \(n\geq 3\), except \(n=5,6,\) or 7 regular \(n\)-valent non-Hamiltonian non \(n\)-edge-colourable graphs are constructed by replacing edges of Petersen's graph by multiple edges, then replacing vertices with complete bipartite graphs. For \(n=5,6\), or 7, the same procedure gives graphs that are regular \(n\)-valent, Hamiltonian, and non \(n\)-edge-colourable but not \(n\)-connected.