Multi-compositions in exponential counting of hypohamiltonian snarks

DOI10.1007/978-3-319-28186-5_4MaRDI QIDQ5354933zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 6 September 2017

Published in Convexity and Discrete Geometry Including Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28186-5_4

zbMATH Keywords

conumerantcounting compositionsdenumerantexponential generatingflip-flopFrobenius numbergraphic composition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Elementary theory of partitions (11P81)

Recommendations

• Exponentially many hypohamiltonian snarks
• Graph compositions. I: Basic enumeration
• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• Compositions of graphs revisited
• scientific article; zbMATH DE number 4162917

Cited in

(1)

• Exponentially many hypohamiltonian snarks

This page was built for publication: Multi-compositions in exponential counting of hypohamiltonian snarks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354933)