Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs (2009)

First Author: Broersma H

Attributed to: Exact algorithms for NP-hard problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/s00373-009-0855-7

Publication URI: http://dx.doi.org/10.1007/s00373-009-0855-7

Type: Journal Article/Review

Parent Publication: Graphs and Combinatorics

Issue: 4