Back to Search
Start Over
The Alon-Tarsi number of $K_5$-minor-free graphs
- Publication Year :
- 2019
-
Abstract
- In this paper, we show the following three theorems. Let $G$ be a $K_5$-minor-free graph. Then Alon-Tarsi number of $G$ is at most $5$, there exists a matching $M$ of $G$ such that the Alon-Tarsi number of $G-M$ is at most $4$, and there exists a forest $F$ such that the Alon-Tarsi number of $G-E(F)$ is at most $3$.<br />Comment: 12 pages,2 figures
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1911.04067
- Document Type :
- Working Paper