RO EN
Choice Numbers of Multi-Bridge Graphs
Authors: Julian Allagan, Benkam Bobga
Keywords: List coloring, chromatic-choosable, l-bridge
– 0.10 Mb
Keywords: List coloring, chromatic-choosable, l-bridge
Abstract
Suppose $ch(G)$ and $\chi(G)$ denote, respectively, the choice number and the chromatic number of a graph $G=(V,E)$. If $ch(G)=\chi(G)$, then $G$ is said to be chromatic-choosable. Here, we find the choice numbers of all multi-bridge or $l$-bridge graphs and classify those that are chromatic-choosable for all $l\ge 2$.Julian Allagan
Elizabeth City State University
Elizabeth City, North Carolina, U.S.A
E-mail:
Benkam Bobga
University of North Georgia
Gainesville, Georgia, U.S.A
E-mail:
Elizabeth City State University
Elizabeth City, North Carolina, U.S.A
E-mail:
Benkam Bobga
University of North Georgia
Gainesville, Georgia, U.S.A
E-mail:
Fulltext
– 0.10 Mb
Contents
- Choice Numbers of Multi-Bridge Graphs
- A remark on the weak Turán’s Theorem
At the request of the author (Received October 21, 2019), the article has been retracted.
- On the locating matrix of a graph and its spectral analysis
- Computing Comprehensive Gröbner Systems: A Comparison of Two Methods
- Stability Analysis of Efficient Portfolios in a Discrete Variant of Multicriteria Investment Problem with Savage's Risk Criteria
- A linear model for multidimensional Big Data visualization
- Non-commutative finite associative algebras of 2-dimension vectors
