New lower bounds for the size of edge chromatic critical graphs
Author:
- 7 April 2004
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 46 (2) , 81-92
Abstract
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, 2004Keywords
This publication has 9 references indexed in Scilit:
- Coloring edges of graphs embedded in a surface of characteristic zeroJournal of Combinatorial Theory, Series B, 2002
- On the Size of Edge Chromatic Critical GraphsJournal of Combinatorial Theory, Series B, 2002
- Planar Graphs of Maximum Degree Seven are Class IJournal of Combinatorial Theory, Series B, 2001
- Remarks on the size of critical edge-chromatic graphsDiscrete Mathematics, 1997
- On the size of Edge-Chromatic critical graphsGraphs and Combinatorics, 1994
- On graphs critical with respect to edge-colouringsDiscrete Mathematics, 1981
- On the chromatic index of a graph, II.1974
- On critical graphs with chromatic index 4Discrete Mathematics, 1974
- SOME UNSOLVED PROBLEMS IN GRAPH THEORYRussian Mathematical Surveys, 1968