On the Independence Number of Edge Chromatic Critical Graphs
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree △ and independence number α (G), α (G) ≤. It is known that α (G) < |V |. In this paper we improve this bound when △≥ 4. Our precise result depends on the number n2 of 2-vertices in G, but in particu...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Zielona Góra
2014-08-01
|
| Col·lecció: | Discussiones Mathematicae Graph Theory |
| Matèries: | |
| Accés en línia: | https://doi.org/10.7151/dmgt.1753 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|