Chromatic sums of biloopless nonseparable near-triangulations on the projective plane

DOI10.1007/s10255-013-0197-3zbMath1261.05016OpenAlexW2394595511MaRDI QIDQ1945972

Yanpei Liu, Zhao-xiang Li, BingFeng Si

Publication date: 17 April 2013

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-013-0197-3

zbMATH Keywords

triangulationenumerating functionchromatic sum functionbiloopless

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) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Correction to ``Chromatic sum equations for rooted cubic planar maps
• The number of rooted 2-connected triangular maps on the projective plane
• On chromatic and dichromatic sum equations
• A Census of Planar Triangulations
• Asymptotic Methods in Enumeration
• Chromatic Sums for Rooted Planar Triangulations, V: Special Equations
• Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
• Chromatic Sums for Rooted Planar Triangulations II: The Case λ = τ + 1
• Chromatic Sums for Rooted Planar Triangulations, III: The Case λ = 3

This page was built for publication: Chromatic sums of biloopless nonseparable near-triangulations on the projective plane