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

DOI10.1007/S10255-013-0197-3zbMATH Open1261.05016OpenAlexW2394595511MaRDI QIDQ1945972FDOQ1945972

ZhaoXiang Li, Yanpei Liu, 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

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

Cites Work

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

Cited In (2)

• Chromatic sums of nonseparable simple maps on the plane.
• Title not available (Why is that?)

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

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