Induced subtrees in interval graphs

DOI10.1007/978-3-642-45278-9_20MaRDI QIDQ2870030zbMATH OpenOpenAlexFDO

Authors Pinar Heggernes, Pim Van 't Hof, Martin Milanič

Publication date 17 January 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_20

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Induced subgraph isomorphism on interval and proper interval graphs
• Induced subgraph isomorphism on proper interval and bipartite permutation graphs
• Cleaning interval graphs
• Subgraph isomorphism in graph classes
• scientific article; zbMATH DE number 4043266

Cited in

(5)

• Fully leafed induced subtrees
• Cleaning interval graphs
• Families of induced trees and their intersection graphs
• Induced subgraph isomorphism on interval and proper interval graphs
• Induced subgraph isomorphism on proper interval and bipartite permutation graphs

This page was built for publication: Induced subtrees in interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870030)