๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Classes of graphs critical for the edge list-ranking problem

โœ Scribed by Malyshev, D. S.

Book ID
125395959
Publisher
Pleiades Publishing
Year
2014
Tongue
English
Weight
564 KB
Volume
8
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A list version of Dirac's theorem on the
A list version of Dirac's theorem on the number of edges in colour-critical graphs
โœ Alexandr V. Kostochka; Michael Stiebitz ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 110 KB ๐Ÿ‘ 2 views

## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194โ€“197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o

New lower bounds for the size of edge ch
New lower bounds for the size of edge chromatic critical graphs
โœ Yue Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 108 KB ๐Ÿ‘ 1 views

## 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, 2004