✦ LIBER ✦

The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13

✍ Scribed by S. Akbari, M. Ghanbari, M. J. Nikmehr

Book ID: 120788854
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 419 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-013-1317-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic index of a graph whose cor

The chromatic index of a graph whose core has maximum degree two

✍ A.J.W. Hilton; Zhao Cheng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 842 KB

The Chromatic Index of a Claw-Free Graph

The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree\(2\)

✍ Akbari, S.; Ghanbari, M.; Ozeki, K. 📂 Article 📅 2014 🏛 Springer Japan 🌐 English ⚖ 157 KB

On the complexity of deciding whether th

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

✍ Elaine M. Eschen; Chính T. Hoàng; R. Sritharan; Lorna Stewart 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Length of Longest Cycles in a Graph Whos

Length of Longest Cycles in a Graph Whose Relative Length is at Least Two

✍ Kenta Ozeki, Tomoki Yamashita 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 249 KB

On the uniform bound of the index of red

On the uniform bound of the index of reducibility of parameter ideals of a module whose polynomial type is at most one

✍ Quy, Pham Hung 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 196 KB

The rainbow connection of a graph is (at

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

✍ Michael Krivelevich; Raphael Yuster 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__