Good characterizations and linear time recognition for 2-probe block graphs
From MaRDI portal
Publication:2403805
DOI10.1016/j.dam.2016.11.015zbMath1369.05140arXiv1611.06285OpenAlexW2555284559MaRDI QIDQ2403805
Publication date: 12 September 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06285
Cites Work
- Unnamed Item
- Unnamed Item
- Block-graph width
- Two characterizations of chain partitioned probe graphs
- On the bi-enhancement of chordal-bipartite probe graphs
- Probe threshold and probe trivially perfect graphs
- On probe interval graphs
- On the complexity of DNA physical mapping
- Algorithmic graph theory and perfect graphs
- Chordal probe graphs
- Characterizing and recognizing probe block graphs
- A characterization of ptolemaic graphs
- Graph Sandwich Problems
This page was built for publication: Good characterizations and linear time recognition for 2-probe block graphs