Bounds on graph compositions and the connection to the Bell triangle

DOI10.1016/J.DISC.2015.12.013MaRDI QIDQ906495zbMATH OpenOpenAlexFDO

Authors 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) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Composition of graphs and the triangle-free subgraph polytope
• Composition of graphs and the triangle free subgraph polytope
• Bell numbers of complete multipartite graphs
• scientific article; zbMATH DE number 7471007
• Lower bounds for combinatorial problems on graphs
• Bell and Stirling numbers for disjoint unions of graphs
• Lower bounds on the number of triangles in a graph
• Combinatorial bounds on paired and multiple domination in triangulations
• Compositions of graphs revisited
• Bounds on the bondage number of a graph

Cites work

• scientific article; zbMATH DE number 6502039 (Why is no real title available?)
• A Problem in Combinations
• Graph compositions. I: Basic enumeration
• The largest singletons of set partitions

Cited in

(5)

• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Graph compositions. I: Basic enumeration
• Basic enumeration of graph compositions with a restricted number of components
• Compositions of complements of graphs
• scientific article; zbMATH DE number 7471007 (Why is no real title available?)

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)