๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Smallest 3-graphs having a 3-colored edge in every k-coloring

โœ Scribed by F. Sterboul

Book ID
103055695
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
496 KB
Volume
27
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

3-consecutive edge coloring of a graph
3-consecutive edge coloring of a graph
โœ Cs. Bujtรกs; E. Sampathkumar; Zs. Tuza; Ch. Dominic; L. Pushpalatha ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB
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.

The number of edge 3-colorings of a plan
The number of edge 3-colorings of a planar cubic graph as a permanent
โœ David E. Scheim ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 370 KB

In this paper, we establish that the number of edge 3-colorings of a finite planar cubic graph G, i.e., 3-colorings of its interchange graph H, is equal to 2\*lPermanent(A)l, where N is the number of edges of G, and A is the 2N X 2iV square matrix formed by repeating each row of the N X 2N vertexdir