✦ LIBER ✦

A comparison of two edge-coloring formulations

✍ Scribed by Jon Lee; Janny Leung

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 497 KB
Volume: 13
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(93)90043-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge coloring a k-tree into two smaller

Edge coloring a k-tree into two smaller trees

✍ Chhajed, Dilip 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 56 KB

The problem of the edge coloring partial k-tree into two partial p-and q-trees with p, q õ k is considered. An algorithm is provided to construct such a coloring with p / q Å k. Usefulness of this result in a Lagrangian decomposition framework to solve certain combinatorial optimization problems is

A generalization of edge-coloring in gra

A generalization of edge-coloring in graphs

✍ S. Louis Hakimi; Oded Kariv 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all

On the two-edge-colorings of perfect gra

On the two-edge-colorings of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o

Separating Type-I Odd-Cycle Inequalities

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation

✍ Jon Lee; Janny Leung; Sven de Vries 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 99 KB

Interval edge coloring of a graph with f

Interval edge coloring of a graph with forbidden colors

✍ Marek Kubale 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 596 KB

## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge