Interval k-graphs : Recognition and Forbidden Obstructions

Müller, H. orcid.org/0000-0002-1123-1774 and Rafiey, A. (2026) Interval k-graphs : Recognition and Forbidden Obstructions. In: Fernau, H. and Kindermann, P., (eds.) Graph-Theoretic Concepts in Computer Science. WG 2025 - 51st International Workshop on Graph-Theoretic Concepts in Computer Science, 11-13 Jun 2025, Otzenhausen, Germany. Lecture Notes in Computer Science, vol. 16124. Springer, Cham, Switzerland, pp. 405-417. ISBN: 978-3-032-11834-9. ISSN: 0302-9743. EISSN: 1611-3349.

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Fernau, H.
  • Kindermann, P.
Copyright, Publisher and Additional Information:

This is an author produced version of a proceedings paper published in Graph-Theoretic Concepts in Computer Science, made available via the University of Leeds Research Outputs Policy under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Dates:
  • Accepted: 15 April 2025
  • Published (online): 2 January 2026
  • Published: 2 January 2026
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Date Deposited: 13 Jul 2026 09:31
Last Modified: 13 Jul 2026 14:53
Published Version: https://link.springer.com/chapter/10.1007/978-3-03...
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-032-11835-6_29
Open Archives Initiative ID (OAI ID):

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)