scientific article
From MaRDI portal
Publication:3922712
zbMath0469.05043MaRDI QIDQ3922712
Roger Entringer, Peter J. Slater
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Computer observations of cycles in cubic graphs ⋮ Estimations for the number of cycles in a graph ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ On graphs with many cycles ⋮ Connected cubic graphs with the maximum number of perfect matchings ⋮ On the minimum number of minimal codewords ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Cycle-maximal triangle-free graphs ⋮ The maximum number of cycles in a graph with fixed number of edges ⋮ On the maximum number of minimal codewords ⋮ Counting structures in the Möbius ladder ⋮ On the maximum number of cycles in a Hamiltonian graph
This page was built for publication: