Subgraph isomorphism on graph classes that exclude a substructure

DOI10.1007/978-3-030-17402-6_8OpenAlexW3110433316MaRDI QIDQ5919398

Tesshu Hanaka, Tom C. van der Zanden, Yoshio Okamoto, Hans L. Bodlaender, Yota Otachi

Publication date: 6 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.10670

zbMATH Keywords

subgraph isomorphismparameterized complexityminor free graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Exploring the gap between treedepth and vertex cover through vertex integrity

This page was built for publication: Subgraph isomorphism on graph classes that exclude a substructure