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

DOI10.26493/1855-3974.1017.0ACMaRDI QIDQ5225032zbMATHOpenAlexFDO

Authors Julian D. Allagan, V. 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)

Recommendations

• \(F\)-WORM colorings: results for 2-connected graphs
• Oriented colorings of partial 2-trees
• Oriented vertex and arc colorings of partial 2-trees
• \([r,s,t]\)-coloring of trees and bipartite graphs
• Split \((n + t)\)-color partitions and 2-color \(F\)-partitions
• The colour lemma. A combinatorial result and its application to tree partitions
• scientific article; zbMATH DE number 1796974
• Counting \(H-\)colorings of partial \(k-\)trees
• Parity vertex colorings of binomial trees
• Algorithms for finding f-colorings of partial k-trees

Cites work

• scientific article; zbMATH DE number 6096647 (Why is no real title available?)
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 1539553 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• 3-consecutive C-colorings of graphs
• Applications of chromatic polynomials involving Stirling numbers
• Chromatic Polynomials
• Clique Covering of Graphs IV. Algorithms
• Coloring mixed hypergraphs: theory, algorithms and applications
• Expansions of Chromatic Polynomials and Log-Concavity
• On feasible sets of mixed hypergraphs
• On rigid circuit graphs
• On the price of equivocation in Byzantine agreement
• On the unimodality of discrete probability measures
• Path-neighborhood graphs
• Stirling numbers of forests and cycles
• Stirling numbers of the second kind and Bell numbers for graphs
• The chromatic spectrum of 3-uniform bi-hypergraphs
• The chromatic spectrum of mixed hypergraphs
• The role of Bell polynomials in integration
• Topics in Chromatic Graph Theory
• Uniform mixed hypergraphs: the possible numbers of colors
• WORM colorings forbidding cycles or cliques
• Worm colorings
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• \(\sigma\)-polynomials and graph coloring

Cited in

(3)

• \(F\)-WORM colorings: results for 2-connected graphs
• Chromatic spectrum of \(K_s\)-WORM colorings of \(K_n\)
• WORM colorings forbidding cycles or cliques

This page was built for publication: ℱ-WORM colorings of some 2-trees: partition vectors

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