scientific article; zbMATH DE number 7471007

MaRDI QIDQ5026930zbMATH OpenFDO

Authors Alain Hertz, A. Hertz, Hadrien Mélot

Publication date 8 February 2022

Full work available at URL https://arxiv.org/abs/2104.00552, https://cs.uwaterloo.ca/journals/JIS/VOL24/Hertz/hertz5.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Bell numbergraph coloringStirling number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Bell and Stirling numbers (11B73)

Recommendations

• Bell and Stirling numbers for graphs
• Some inequalities for the Bell numbers
• Bounds on graph compositions and the connection to the Bell triangle
• Deciding the Bell number for hereditary graph properties
• Deciding the Bell number for hereditary graph properties
• Bell and Stirling numbers for disjoint unions of graphs
• Bell numbers of complete multipartite graphs
• Eine zahlentheoretische Anwendung der Graphentheorie.
• Inequalities involving the irredundance number of a graph
• Combinatorial proofs of some Bell number formulas

Cites work

• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
• Bell and Stirling numbers for disjoint unions of graphs
• Bell and Stirling numbers for graphs
• Counting the number of non-equivalent vertex colorings of a graph
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 7114889 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• On the average rank of an element in a filter of the partition lattice
• On the number of distinct block sizes in partitions of a set
• Stirling numbers of forests and cycles
• Stirling numbers of the second kind and Bell numbers for graphs

Cited in

(6)

• Bell and Stirling numbers for disjoint unions of graphs
• Bell and Stirling numbers for graphs
• Emerging applications, models and algorithms in combinatorial optimization
• Upper bounds on the average number of colors in the non-equivalent colorings of a graph
• Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
• Bounds on graph compositions and the connection to the Bell triangle

This page was built for publication:

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