On (k,ℓ)-Graph Sandwich Problems

DOI10.1007/978-3-642-38756-2_20zbMath1303.68092OpenAlexW79474495MaRDI QIDQ5405929

Fábio Protti, Sulamita Klein, Fernanda Couto, Loana Tito Nogueira, Luérbio Faria

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

zbMATH Keywords

boundary conditionsgraph sandwich problems\((k, \ell )\)-graphschordal-\((2,1)\) graphsstrongly chordal-\( (2,\ell )\) graphsstrongly chordal-\((2,1)\) graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On (k,ℓ)-Graph Sandwich Problems