A generalization of chromatic polynomial of a graph subdivision

DOI10.1007/S10958-012-0745-ZzbMATH Open1254.05079OpenAlexW2033486128MaRDI QIDQ690546FDOQ690546

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4081583
• On chromatic roots of large subdivisions of graphs
• Chromatic polynomials and \(k\)-trees
• Subdivisions and chromatic roots
• On chromatic uniqueness of uniform subdivisions of graphs

zbMATH Keywords

frequency assignment problemcomplete graph subdivisiontask assignment problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Chromatic Polynomials
• Title not available (Why is that?)

Cited In (5)

• Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
• A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
• Analysis approach to finite monoids
• Combinatorial properties of subdivision meshes
• Some array polynomials over special monoid presentations

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

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