Counting structures in the Möbius ladder

DOI10.1016/S0012-365X(97)00086-1zbMath0957.05057OpenAlexW2104354350MaRDI QIDQ1584218

John P. McSorley

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

zbMATH Keywords

countingcubic graphMöbius ladderextremal properties

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (6)

Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Unnamed Item ⋮ On locating chromatic number of Möbius ladder graphs

Uses Software

• OEIS

Cites Work

• Recursive families of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting structures in the Möbius ladder