𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On edge orienting methods for graph coloring

✍ Scribed by Bernard Gendron; Alain Hertz; Patrick St-Louis

Book ID
106407071
Publisher
Springer US
Year
2006
Tongue
English
Weight
513 KB
Volume
13
Category
Article
ISSN
1382-6905

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 Edge Coloring Bipartite Graphs
On Edge Coloring Bipartite Graphs
✍ Cole, Richard; Hopcroft, John πŸ“‚ Article πŸ“… 1982 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 825 KB
On vertex-coloring edge-weighting of gra
On vertex-coloring edge-weighting of graphs
✍ Hongliang Lu; Xu Yang; Qinglin Yu πŸ“‚ Article πŸ“… 2009 πŸ› Higher Education Press and Springer 🌐 English βš– 159 KB
On edge colorings of 1-planar graphs
On edge colorings of 1-planar graphs
✍ Xin Zhang; Jian-Liang Wu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 155 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