Work

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

Year: 2025

Type: article

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.

Source: Mathematics

DOI: 10.3390/math13081337

Authors: Julian Allagan, Jianning Su, Weizheng Gao, Shanzhen Gao

Institutions: Elizabeth City State University, Georgia State University, Virginia State University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $3,137

OpenAlex ID: W4409606314

FWCI: 0.961

Cites: 19

Cited by: 2

Related to: 10