The Alon-Tarsi number of cupolarotundas and gyroelongated rotunda

The Alon-Tarsi number of a graph G is the smallest k so that there exists an orientation D of G with max outdegree k - 1 satisfying the number of even Eulerian subgraphs different from the number of odd Eulerian subgraphs. This paper is devoted to the study of the Alon-Tarsi number of cupolarotundas and gyroelongated rotunda.

Authors

Institutions

Publication Details

Journal
Electronic Journal of Graph Theory and Applications
Published
2024-10-24
DOI
https://doi.org/10.5614/ejgta.2024.12.2.5
Primary Topic
Structural Analysis and Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Alon-Tarsi number of cupolarotundas and gyroelongated rotunda

Zeling Shao, Zhiguo Li, Yujia Gai
Electronic Journal of Graph Theory and Applications
Structural Analysis and Optimization
article

The Alon-Tarsi number of cupolarotundas and gyroelongated rotunda

Zeling Shao, Zhiguo Li, Yujia Gai
article en

Abstract

The Alon-Tarsi number of a graph G is the smallest k so that there exists an orientation D of G with max outdegree k - 1 satisfying the number of even Eulerian subgraphs different from the number of odd Eulerian subgraphs. This paper is devoted to the study of the Alon-Tarsi number of cupolarotundas and gyroelongated rotunda.

Electronic Journal of Graph Theory and ApplicationsVol. 12(2)
Hebei University of Technology (CN)
Natural Science Foundation of Hebei Province
Openalex Percentile: Top 75%
Structural Analysis and Optimization
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.