Maximum average degree of list-edge-critical graphs and Vizing's conjecture
| Main Authors: | Harrelson, Joshua; Faculty of Mathematics and Statistics, Middle Georgia State University, United States, Reavis, Hannah; Department of Mathematics and Statistics, Middle Georgia State University, United States |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1409 https://www.ejgta.org/index.php/ejgta/article/view/1409/pdf_229 |
Daftar Isi:
- Vizing conjectured that χ′l(G)≤Δ + 1 for all graphs. For a graph G and nonnegative integer k, we say G is a k-list-edge-critical graph if χ′l(G)>k, but χ′l(G − e)≤k for all e ∈ E(G). We use known results for list-edge-critical graphs to verify Vizing’s conjecture for G with mad(G)<(Δ + 3)/2 and Δ ≤ 9.