scholarly journals A reduced upper bound for an edge-coloring problem from relation algebra

2019 ◽  
Vol 80 (2) ◽  
Author(s):  
Jeremy F. Alm ◽  
David A. Andrews
Keyword(s):  
Upper Bound ◽  
Edge Coloring ◽  
Relation Algebra ◽  
Coloring Problem

scholarly journals On the max-weight edge coloring problem

2009 ◽  
Vol 20 (4) ◽  
pp. 429-442 ◽  
Author(s):  
Giorgio Lucarelli ◽  
Ioannis Milis ◽  
Vangelis T. Paschos
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

On the Maximum Edge Coloring Problem

2009 ◽  
pp. 279-292 ◽  
Author(s):  
Giorgio Lucarelli ◽  
Ioannis Milis ◽  
Vangelis Th. Paschos
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY

2004 ◽  
Vol 13 (02) ◽  
pp. 375-385 ◽  
Author(s):  
HIROSHI TAMURA ◽  
KAORU WATANABE ◽  
MASAKAZU SENGOKU ◽  
SHOJI SHINODA
Keyword(s):  
Wireless Networks ◽  
Graph Theory ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Edge Coloring ◽  
Multihop Wireless Networks ◽  
Personal Communication ◽  
Multihop Wireless ◽  
Coloring Problem ◽  
Communication Devices

Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method.

On the edge-coloring problem for a class of 4-regular maps

1981 ◽  
Vol 5 (3) ◽  
pp. 269-275 ◽  
Author(s):  
F. Jaeger ◽  
H. Shank
Keyword(s):  
Edge Coloring ◽  
Coloring Problem ◽  
Regular Maps

scholarly journals Investigations on an edge coloring problem

1971 ◽  
Vol 1 (2) ◽  
pp. 167-179 ◽  
Author(s):  
D. de Werra
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

Stability of extremal hypergraphs with applications to an edge-coloring problem

2017 ◽  
Vol 61 ◽  
pp. 263-269 ◽  
Author(s):  
Lucas de Oliveira Contiero ◽  
Carlos Hoppen ◽  
Hanno Lefmann ◽  
Knut Odermann
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

Complexity classification of the edge coloring problem for a family of graph classes

2017 ◽  
Vol 27 (2) ◽  
Author(s):  
Dmitriy S. Malyshev
Keyword(s):  
Edge Coloring ◽  
Complete Classification ◽  
Chromatic Index ◽  
Forbidden Subgraphs ◽  
Coloring Problem ◽  
Graph Classes ◽  
Complexity Classification ◽  
Index Problem

AbstractA class of graphs is called monotone if it is closed under deletion of vertices and edges. Any such class may be defined in terms of forbidden subgraphs. The chromatic index of a graph is the smallest number of colors required for its edge-coloring such that any two adjacent edges have different colors. We obtain a complete classification of the complexity of the chromatic index problem for all monotone classes defined in terms of forbidden subgraphs having at most 6 edges or at most 7 vertices.

Sign in / Sign up

Export Citation Format

Share Document