Chordal probe graphs
From MaRDI portal
Publication:1887057
DOI10.1016/j.dam.2003.12.009zbMath1059.05089OpenAlexW2073711843MaRDI QIDQ1887057
Marina Lipshteyn, Martin Charles Golumbic
Publication date: 23 November 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.12.009
Related Items (16)
Good characterizations and linear time recognition for 2-probe block graphs ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Adjacency matrices of probe interval graphs ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ A characterization of chain probe graphs ⋮ Two characterizations of chain partitioned probe graphs ⋮ Path-bicolorable graphs ⋮ On probe permutation graphs ⋮ On the bi-enhancement of chordal-bipartite probe graphs ⋮ Characterizing and recognizing probe block graphs ⋮ The sandwich problem for decompositions and almost monotone properties ⋮ The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs ⋮ Probe threshold and probe trivially perfect graphs ⋮ Path-Bicolorable Graphs ⋮ Probe interval and probe unit interval graphs on superclasses of cographs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tolerance graphs
- The strong perfect graph theorem
- On probe interval graphs
- Incidence matrices and interval graphs
- Representation of a finite graph by a set of intervals on the real line
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
This page was built for publication: Chordal probe graphs