Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

Kloks, T, Muller, H and Vuskovic, K (2009) Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Journal of Combinatorial Theory: Series B, 99 (5). 733 - 800 . ISSN 0095-8956

Abstract

Metadata

Authors/Creators:
  • Kloks, T
  • Muller, H
  • Vuskovic, K
Copyright, Publisher and Additional Information: © 2009, Elsevier. This is an author produced version of a paper published in Journal of Combinatorial Theory: Series B. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: even-hole-free graphs, decomposition, chi-bounded families, beta-perfect graphs, greedy coloring algorithm, beta-perfect graphs
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 20 Jun 2012 13:07
Last Modified: 18 Sep 2016 15:41
Published Version: http://dx.doi.org/10.1016/j.jctb.2008.12.005
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.jctb.2008.12.005

Download

Filename: diamond.pdf

Share / Export

Statistics