✦ LIBER ✦

Linear algorithms for edge-coloring trees and unicyclic graphs

✍ Scribed by Sandra Mitchell; Stephen Hedetniemi

Book ID: 113162061
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 300 KB
Volume: 9
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90049-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Linear-Time Algorithms for Edge-Colo

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

✍ Richard Cole; Łukasz Kowalik 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

Fast algorithms for edge-coloring planar

Fast algorithms for edge-coloring planar graphs

✍ Marek Chrobak; Moti Yung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Improved edge-coloring algorithms for pl

Improved edge-coloring algorithms for planar graphs

✍ Marek Chrobak; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 808 KB

Analysis of approximate algorithms for e

Analysis of approximate algorithms for edge-coloring bipartite graphs

✍ Ravi Jain; John Werth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A linear time algorithm for edge colorin

A linear time algorithm for edge coloring of binomial trees

✍ M. Kubale; K. Piwakowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

On linear-time algorithms for five-color

On linear-time algorithms for five-coloring planar graphs

✍ Greg N. Frederickson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 530 KB