ℱ-WORM colorings of some 2-trees: partition vectors

DOI10.26493/1855-3974.1017.0aczbMath1416.05097OpenAlexW2901517279MaRDI QIDQ5225032

Julian D. Allagan, Vitaly I. Voloshin

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1017.0ac

zbMATH Keywords

partitionStirling numbers2-treemaximal outerplanar

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Bell and Stirling numbers (11B73) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic spectrum of 3-uniform bi-hypergraphs
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• On rigid circuit graphs
• On the unimodality of discrete probability measures
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• \(\sigma\)-polynomials and graph coloring
• Stirling numbers of forests and cycles
• Uniform mixed hypergraphs: the possible numbers of colors
• Worm colorings
• On the price of equivocation in byzantine agreement
• 3-consecutive C-colorings of graphs
• Clique Covering of Graphs IV. Algorithms
• Expansions of Chromatic Polynomials and Log-Concavity
• Topics in Chromatic Graph Theory
• Path-neigborhood graphs
• Chromatic Polynomials
• The role of Bell polynomials in integration