Premium
New lower bounds for the size of edge chromatic critical graphs
Author(s) -
Zhao Yue
Publication year - 2004
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10173
Subject(s) - mathematics , combinatorics , chromatic scale , critical graph , enhanced data rates for gsm evolution , graph , degree (music) , discrete mathematics , edge coloring , graph theory , upper and lower bounds , line graph , computer science , graph power , physics , mathematical analysis , telecommunications , acoustics
In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom