Counting structures in the Möbius ladder
From MaRDI portal
Publication:1584218
DOI10.1016/S0012-365X(97)00086-1zbMath0957.05057MaRDI QIDQ1584218
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00086-1
Related Items
On locating chromatic number of Möbius ladder graphs, Unnamed Item, Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements, Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs, Disjoint path covers with path length constraints in restricted hypercube-like graphs, Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Uses Software
Cites Work