Nonisomorphic Orientable Pentagonal Embeddings and Colorings of Complete Graphs

In this paper, we construct the current graph and pentagonal rule of the complete graph pentagonal embedding, and prove that the complete graph K 31 has at least 663552 nonisomorphic orientable pentagonal embeddings. Each embedding has 720 5-edge colorings, and each coloring appears on each face of the orientable pentagonal embeddings. For all pentagonal embeddings in the orientable surface 𝒮 125 , these embeddings determine polyhedra with a minimal number of pentagons. We also establish similar results for the complete graph K 11 .

Authors

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2026-11-12
DOI
https://doi.org/10.1142/s1793830926501144
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Nonisomorphic Orientable Pentagonal Embeddings and Colorings of Complete Graphs

家宏 刘, Zhaoxiang Li
Discrete Mathematics Algorithms and Applications
Advanced Graph Theory Research
article

Nonisomorphic Orientable Pentagonal Embeddings and Colorings of Complete Graphs

家宏 刘, Zhaoxiang Li
article en

Abstract

In this paper, we construct the current graph and pentagonal rule of the complete graph pentagonal embedding, and prove that the complete graph K 31 has at least 663552 nonisomorphic orientable pentagonal embeddings. Each embedding has 720 5-edge colorings, and each coloring appears on each face of the orientable pentagonal embeddings. For all pentagonal embeddings in the orientable surface 𝒮 125 , these embeddings determine polyhedra with a minimal number of pentagons. We also establish similar results for the complete graph K 11 .

Discrete Mathematics Algorithms and Applications
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon