scientific article; zbMATH DE number 2119749

zbMath1058.05060MaRDI QIDQ4829024

Jeremy P. Spinrad, Ross M. McConnell

Publication date: 29 November 2004

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

zbMATH Keywords

DNA

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (17)

Finding hidden independent sets in interval graphs ⋮ Chordal probe graphs ⋮ Adjacency matrices of probe interval graphs ⋮ Characterizing interval graphs which are probe unit interval graphs ⋮ PC trees and circular-ones arrangements. ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ Recognition of probe proper interval graphs ⋮ A simpler linear-time recognition of circular-arc graphs ⋮ A characterization of chain probe graphs ⋮ Partitioned probe comparability graphs ⋮ On the bi-enhancement of chordal-bipartite probe graphs ⋮ Recognizing edge clique graphs among interval graphs and probe interval graphs ⋮ The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs ⋮ A characterization of cycle-free unit probe interval graphs ⋮ Linear-Time Recognition of Probe Interval Graphs ⋮ 2-tree probe interval graphs have a large obstruction set

This page was built for publication: