On rank-width of even-hole-free graphs

Adler, I, Le, NK, Muller, H et al. (3 more authors) (2017) On rank-width of even-hole-free graphs. Discrete Mathematics and Theoretical Computer Science, 19 (1). 25. ISSN 1462-7264

Abstract

Metadata

Authors/Creators:
  • Adler, I
  • Le, NK
  • Muller, H
  • Radovanovic, M
  • Trotignon, N
  • Vuskovic, K
Copyright, Publisher and Additional Information: © 2017 by the Author(s). Distributed under a Creative Commons Attribution 4.0 International License.
Keywords: even-hole-free graph, (diamond, even hole)-free graph, clique cutset, clique-width, rank-width
Dates:
  • Published: 5 October 2017
  • Accepted: 3 August 2017
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRCEP/N019660/1
Depositing User: Symplectic Publications
Date Deposited: 17 Jul 2017 11:21
Last Modified: 06 Sep 2019 14:51
Published Version: http://dmtcs.episciences.org/3827
Status: Published
Publisher: Discrete Mathematics and Theoretical Computer Science
Identification Number: https://doi.org/10.23638/DMTCS-19-1-24

Download

Share / Export

Statistics