scientific article; zbMATH DE number 5279393

zbMath1153.05324MaRDI QIDQ5387698

Van Bang Le, H. N. de Ridder

Publication date: 27 May 2008

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85/showToc.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recognition algorithmsvertex partitionprobe split graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (12)

Adjacency matrices of probe interval graphs ⋮ An algorithmic characterization of splitting signed graph ⋮ The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy ⋮ A characterization of chain probe graphs ⋮ Recognition of split-graphic sequences ⋮ Block-graph width ⋮ Probe threshold and probe trivially perfect graphs ⋮ Probe interval and probe unit interval graphs on superclasses of cographs ⋮ Minimal obstructions for a matrix partition problem in chordal graphs

This page was built for publication: