Hamiltonicity Of Edge Chromatic Critical Graphs

Keywords

Critical graphs; Edge coloring; Hamiltonian cycles

Abstract

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order n with maximum degree at least [Formula presented] is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order n with maximum degree at least [Formula presented] is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order n with maximum degree at least [Formula presented] is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs.

Publication Date

12-1-2017

Publication Title

Discrete Mathematics

Volume

340

Issue

12

Number of Pages

3011-3015

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.disc.2017.07.013

Socpus ID

85028082408 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85028082408

This document is currently not available here.

Share

COinS