Bounds on graph compositions and the connection to the Bell triangle

DOI10.1016/J.DISC.2015.12.013zbMATH Open1329.05246OpenAlexW2197011238MaRDI QIDQ906495

Todd Tichenor

Publication date: 21 January 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.013

zbMATH Keywords

Bell numbersBell trianglecomposition numbergraph compositions

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• The largest singletons of set partitions
• Graph compositions. I: Basic enumeration
• A Problem in Combinations

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Compositions of graphs revisited 👍 👎
• Bounds on the bondage number of a graph 👍 👎
• Bell numbers of complete multipartite graphs 👍 👎
• Combinatorial bounds on paired and multiple domination in triangulations 👍 👎
• Composition of graphs and the triangle-free subgraph polytope 👍 👎
• Composition of graphs and the triangle free subgraph polytope 👍 👎
• Lower bounds for combinatorial problems on graphs 👍 👎
• Lower bounds on the number of triangles in a graph 👍 👎

This page was built for publication: Bounds on graph compositions and the connection to the Bell triangle

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