Hamiltonian coverings of some graphs

DOI10.1016/j.ejc.2005.01.009zbMath1087.05049OpenAlexW2061092108MaRDI QIDQ2488839

Pierre-Alain Mazet

Publication date: 16 May 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.01.009

zbMATH Keywords

divisor graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On path partitions of the divisor graph ⋮ Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)

Cites Work

• A simplified proof of the partition formula
• Study of the divisor graph. III
• When do Beurling generalized integers have a density?
• Sur le graphe divisoriel