Choice Numbers of Chordal, Chordless, and Some Non-Chordal Graphs

Julian Allagan (), Jianning Su, Weizheng Gao and Shanzhen Gao
Additional contact information
Julian Allagan: Department of Mathematics, Computer Science and Engineering Technology, Elizabeth City State University, Elizabeth City, NC 27909, USA
Jianning Su: Perimeter College, Georgia State University, Atlanta, GA 30303, USA
Weizheng Gao: Department of Mathematics, Computer Science and Engineering Technology, Elizabeth City State University, Elizabeth City, NC 27909, USA
Shanzhen Gao: Computer Information Systems, Virginia State University, Petersburg, VA 23806, USA

Mathematics, 2025, vol. 13, issue 8, 1-10

Abstract: 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.

Keywords: list coloring; chromatic-choosable; chordal; chordless; non-chordal (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/8/1337/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/8/1337/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:8:p:1337-:d:1638010

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().