Problems and results in combinatorial analysis and graph theory
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
The maximum number of edges in 2K2-free graphs of bounded degree
Discrete Mathematics
The strong chromatic index of a cubic graph is at most 10
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Induced matchings in cubic graphs
Journal of Graph Theory
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Note: Strong edge colouring of subcubic graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some previous results on the strong edge-colouring of subcubic graphs by showing that every subcubic graph with maximum average degree strictly less than 73 (resp. 52, 83, 207) can be strongly edge-coloured with six (resp. seven, eight, nine) colours. These upper bounds are optimal except the one of 83. Also, we prove that every subcubic planar graph without 4-cycles and 5-cycles can be strongly edge-coloured with nine colours.