𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs

✍ Scribed by Aslanyan, Davit; Mkrtchyan, Vahan V.; Petrosyan, Samvel S.; Vardanyan, Gagik N.

Book ID
123022555
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
709 KB
Volume
172
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum Ξ”-edge-colorable subgraphs of cl
Maximum Ξ”-edge-colorable subgraphs of class II graphs
✍ Vahan V. Mkrtchyan; Eckhard Steffen πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 180 KB

## Abstract A graph __G__ is class II, if its chromatic index is at least Ξ” + 1. Let __H__ be a maximum Δ‐edge‐colorable subgraph of __G__. The paper proves best possible lower bounds for |__E__(__H__)|/|__E__(__G__)|, and structural properties of maximum Δ‐edge‐colorable subgraphs. It is shown tha

4-edge-coloring graphs of maximum degree
4-edge-coloring graphs of maximum degree 3 in linear time
✍ San Skulrattanakulchai πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 65 KB

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.

[Lecture Notes in Computer Science] Appr
[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 5426 || On the Maximum Edge Coloring Problem
✍ Bampis, Evripidis; Skutella, Martin πŸ“‚ Article πŸ“… 2009 πŸ› Springer Berlin Heidelberg 🌐 German βš– 507 KB

This Book Constitutes The Thoroughly Refereed Post Workshop Proceedings Of The 6th International Workshop On Approximation And Online Algorithms, Waoa 2008, Held In Karlsruhe, Germany, In September 2008 As Part Of The Algo 2008 Conference Event. The 22 Revised Full Papers Presented Were Carefully Re