Chromatic sums of nonseparable simple maps on the plane.

DOI10.1007/BF02936187zbMath1046.05037MaRDI QIDQ1432808

Yanpei Liu, Zhao-xiang Li

Publication date: 22 June 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

chromatic sum functionsenumerating function equationsimple maps

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Edge covering coloring of nearly bipartite graphs, Some properties on \(f\)-edge covered critical graphs, A special \(f\)-edge cover-coloring of multigraphs, More on cutting a polygon into triangles of equal areas, The classification of complete graphs \(K_n\) on \(f\)-coloring, Circular list colorings of some graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of the asymptotic behaviour of maps
• The asymptotic number of rooted nonseparable maps on a surface
• Chromatic polynomials for regular graphs and modified wheels
• The number of rooted 2-connected triangular maps on the projective plane
• Chromatic polynomials of homeomorphism classes of graphs
• Dichromatic sums revisited
• On chromatic and dichromatic sum equations
• On chromatic polynomials and the golden ratio
• Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
• Enumeration of Non-Separable Planar Maps
• On the Enumeration of Rooted Non-Separable Planar Maps
• Dichromatic polynomials and Potts models summed over rooted maps