scholarly journals The strong fractional choice number of series–parallel graphs

2020 ◽  
Vol 343 (5) ◽  
pp. 111796 ◽  
Author(s):  
Xuer Li ◽  
Xuding Zhu
Keyword(s):  
Choice Number

scholarly journals Sum choice number of generalizedθ-graphs

2017 ◽  
Vol 340 (11) ◽  
pp. 2633-2640 ◽  
Author(s):  
Christoph Brause ◽  
Arnfried Kemnitz ◽  
Massimiliano Marangio ◽  
Anja Pruchnewski ◽  
Margit Voigt
Keyword(s):  
Choice Number ◽  
Sum Choice Number

Edge (m,k)-choosability of graphs

2021 ◽  
Author(s):  
P. Soorya ◽  
K. A. Germina
Keyword(s):  
Connected Graph ◽  
Matching Number ◽  
Graph Theoretic ◽  
Maximum Value ◽  
Choice Number ◽  
The Given ◽  
Simple Connected Graph

Let [Formula: see text] be a simple, connected graph of order [Formula: see text] and size [Formula: see text] Then, [Formula: see text] is said to be edge [Formula: see text]-choosable, if there exists a collection of subsets of the edge set, [Formula: see text] of cardinality [Formula: see text] such that [Formula: see text] whenever [Formula: see text] and [Formula: see text] are incident. This paper initiates a study on edge [Formula: see text]-choosability of certain fundamental classes of graphs and determines the maximum value of [Formula: see text] for which the given graph [Formula: see text] is edge [Formula: see text]-choosable. Also, in this paper, the relation between edge choice number and other graph theoretic parameters is discussed and we have given a conjecture on the relation between edge choice number and matching number of a graph.

scholarly journals Beyond Ohba’s Conjecture: A bound on the choice number ofk-chromatic graphs withnvertices

2015 ◽  
Vol 43 ◽  
pp. 295-305 ◽  
Author(s):  
Jonathan A. Noel ◽  
Douglas B. West ◽  
Hehui Wu ◽  
Xuding Zhu
Keyword(s):  
Choice Number

scholarly journals On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method

2015 ◽  
Vol 32 (3) ◽  
pp. 1137-1153 ◽  
Author(s):  
Jakub Przybyło ◽  
Jens Schreyer ◽  
Erika Škrabul’áková
Keyword(s):  
Compression Method ◽  
Plane Graphs ◽  
Choice Number ◽  
Entropy Compression ◽  
Entropy Compression Method

The Choice Number of Dense Random Graphs

2000 ◽  
Vol 9 (1) ◽  
pp. 19-26 ◽  
Author(s):  
MICHAEL KRIVELEVICH
Keyword(s):  
Random Graphs ◽  
Choice Number

scholarly journals The Interactive Sum Choice Number of Graphs

2017 ◽  
Vol 61 ◽  
pp. 139-145
Author(s):  
Marthe Bonamy ◽  
Kitty Meeks
Keyword(s):  
Choice Number ◽  
Sum Choice Number

scholarly journals On the asymptotic value of the choice number of complete multi-partite graphs

2006 ◽  
Vol 52 (2) ◽  
pp. 123-134 ◽  
Author(s):  
Nurit Gazit ◽  
Michael Krivelevich
Keyword(s):  
Asymptotic Value ◽  
Choice Number
Sign in / Sign up

Export Citation Format

Share Document