𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Determining optimally ordered pairs using edge-coloring of graphs

✍ Scribed by Cloete, I.; Cloete, W.G.

Book ID
114550402
Publisher
Institute of Electrical and Electronics Engineers
Year
1993
Weight
362 KB
Volume
23
Category
Article
ISSN
0018-9472

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal edge coloring of large graphs
Optimal edge coloring of large graphs
✍ G�mez, J.; Escudero, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 3 views

Most of the general families of large considered graphs in the context of the so-called (⌬, D) problem-that is, how to obtain graphs with maximum order, given their maximum degree ⌬ and their diameter D-known up to now for any value of ⌬ and D, are obtained as product graphs, compound graphs, and ge

Optimal acyclic edge-coloring of cubic g
Optimal acyclic edge-coloring of cubic graphs
✍ Lars Døvling Andersen; Edita Máčajová;; Ján Mazák 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

An __acyclic edge‐coloring__ of a graph is a proper edge‐coloring such that the subgraph induced by the edges of any two colors is acyclic. The __acyclic chromatic index__ of a graph __G__ is the smallest number of colors in an acyclic edge‐coloring of __G__. We prove that the acyclic chromatic inde

Alternating walks in partially 2-edge-co
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
✍ AndréE. Kézdy; Chi Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 292 KB

A graph is partially 2-edge-colored if edges of G are colored by two colors, possibly with some edges uncolored. A walk is alternating in a partially 2-edge-colored graph if the given 2edge-coloring can be extended to all edges of G such that colors alternate as the walk is traversed. We present a p