Choice Numbers of Chordal, Chordless, and Some Non-Chordal Graphs
We prove that chordal graphs are chromatic-choosable and present a decomposition theorem to help estimate the choice numbers for certain classes of chordless and non-chordal graphs.
Authors
- Shanzhen Gao (ORCID: https://orcid.org/0000-0002-3856-2530)
- Jianning Su (ORCID: https://orcid.org/0000-0002-7443-8940)
- Julian D. Allagan (ORCID: https://orcid.org/0000-0003-0275-4239)
- Weizheng Gao (ORCID: https://orcid.org/0009-0003-5078-6283)
Institutions
- Virginia State University (US)
- Georgia State University (US)
- Elizabeth City State University (US)
Publication Details
- Journal
- Mathematics
- Published
- 2025-04-19
- DOI
- https://doi.org/10.3390/math13081337
- Citations
- 1
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 1.50