✦ LIBER ✦

Investigations on an edge coloring problem

✍ Scribed by D. de Werra

Book ID: 107748111
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 527 KB
Volume: 1
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90022-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An edge coloring problem for graph produ

An edge coloring problem for graph products

✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

On the max-weight edge coloring problem

✍ Giorgio Lucarelli; Ioannis Milis; Vangelis T. Paschos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 416 KB

Approximating the max-edge-coloring prob

Approximating the max-edge-coloring problem

✍ N. Bourgeois; G. Lucarelli; I. Milis; V.Th. Paschos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Extending an edge-coloring

✍ O. Marcotte; P. D. Seymour 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

## Abstract When can a __k__‐edge‐coloring of a subgraph __K__ of a graph __G__ be extended to a __k__‐edge‐coloring of __G__? One necessary condition is that for all __X ⊆ E__(__G__) ‐ __E__(__K__), where μ~i~(__X__) is the maximum cardinality of a subset of __X__ whose union with the set of edg

An extremal coloring problem on matrices

✍ Hans-Dietrich O.F Gronau; Roger Labahn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Investigation on Interval Edge-Colorings

Investigation on Interval Edge-Colorings of Graphs

✍ A.S. Asratian; R.R. Kamalian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 380 KB

An edge-coloring of a simple graph \(G\) with colors \(1,2, \ldots, t\) is called an interval \(t\)-coloring [3] if at least one edge of \(G\) is colored by color \(i, i=1, \ldots, t\) and the edges incident with each vertex \(x\) are colored by \(d_{G}(x)\) consecutive colors, where \(d_{G}(x)\) is