| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776777 | Discrete Mathematics | 2017 | 8 Pages |
Abstract
In this paper we obtain sharp upper bounds for the sum choice number of all generalized θ-graphs with k1â¥2 and characterize all generalized θ-graphs G which attain the trivial upper bound |V(G)|+|E(G)|.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt,