Title

A Sufficient Condition For Edge Chromatic Critical Graphs To Be Hamiltonian - An Approach To Vizing'S 2-Factor Conjecture

Keywords

2-factors; critical graphs; edge colorings; Hamiltonian cycles

Abstract

In this article, we consider Vizing's 2-Factor Conjecture which claims that any Δ-critical graph has a 2-factor, and show that if G is a Δ-critical graph with n vertices satisfying Δ≥6n/7, then G is Hamiltonian and thus G has a 2-factor. Meanwhile in this article, we also consider long cycles of overfull critical graphs and obtain that if G is an overfull Δ-critical graph with n vertices, then the circumference of G is at least min{2Δ,n}.© 2012 Wiley Periodicals, Inc. J. Graph Theory 00: 1-14, 2012 © 2012 Wiley Periodicals, Inc.

Publication Date

1-1-2013

Publication Title

Journal of Graph Theory

Volume

73

Issue

4

Number of Pages

469-482

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/jgt.21689

Socpus ID

84878634748 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS