๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sufficient conditions for a planar graph to be list edge -colorable and list totally -colorable

โœ Scribed by Lu, Qiuli; Miao, Zhengke; Wang, Yingqian


Book ID
123118473
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
207 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Sufficient conditions for a graph to be
โœ Shiying Wang; Shangwei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 236 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut __F__ of a connected graph __G__ is an edge cut such that __G__โ€__F__ has no isolated vertex. The restricted edge connectivity ฮปโ€ฒ is the minimum cardinality over all re