ℱ-WORM colorings of some 2-trees: partition vectors
DOI10.26493/1855-3974.1017.0ACzbMATH Open1416.05097OpenAlexW2901517279MaRDI QIDQ5225032FDOQ5225032
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
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
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
- \(\sigma\)-polynomials and graph coloring
- Stirling numbers of forests and cycles
- Stirling numbers of the second kind and Bell numbers for graphs
- Applications of chromatic polynomials involving Stirling numbers
- Expansions of Chromatic Polynomials and Log-Concavity
- On rigid circuit graphs
- Title not available (Why is that?)
- 3-consecutive C-colorings of graphs
- Title not available (Why is that?)
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Uniform mixed hypergraphs: the possible numbers of colors
- The chromatic spectrum of 3-uniform bi-hypergraphs
- On the price of equivocation in byzantine agreement
- Title not available (Why is that?)
- Clique Covering of Graphs IV. Algorithms
- Title not available (Why is that?)
- Worm colorings
- Title not available (Why is that?)
- Chromatic Polynomials
- The role of Bell polynomials in integration
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
- On the unimodality of discrete probability measures
- Topics in Chromatic Graph Theory
- Path-neigborhood graphs
Cited In (1)
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)
