A generalization of chromatic polynomial of a graph subdivision

DOI10.1007/s10958-012-0745-zzbMath1254.05079OpenAlexW2033486128MaRDI QIDQ690546

M. C. Fu

Publication date: 28 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-0745-z

zbMATH Keywords

frequency assignment problemcomplete graph subdivisiontask assignment problem

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Analysis approach to finite monoids ⋮ Some array polynomials over special monoid presentations

Cites Work

• Chromatic Polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of chromatic polynomial of a graph subdivision