Recognition of probe distance-hereditary graphs

DOI10.1016/j.dam.2012.08.029zbMath1255.05157OpenAlexW2070935337MaRDI QIDQ1932454

Peter Rossmanith, Ling-Ju Hung, Maw-Shang Chang

Publication date: 18 January 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.029

zbMATH Keywords

probe graphsprobe bipartite distance-hereditary graphsprobe distance-hereditary graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (2)

The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy

This page was built for publication: Recognition of probe distance-hereditary graphs