Maximal Edge-Colorings of Graphs

被引：2

作者：

Meszka, Mariusz ^{[1
]}

Tyniec, Magdalena ^{[1
]}

机构：

[1] AGH Univ Sci & Technol, Krakow, Poland

来源：

GRAPHS AND COMBINATORICS | 2017年 / 33卷 / 06期

关键词：

Edge coloring; Maximal configuration;

D O I：

10.1007/s00373-017-1797-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A maximal edge-coloring of a graph G of order n is a proper edge-coloring of G with. chi'(K-n) colors such that no edge of the complement (G) over bar of G can be attached to G without violating conditions of a proper edge-coloring. We almost completely determine sets of all sizes of graphs which admit maximal edge-colorings.

引用

页码：1451 / 1458

页数：8