A characterization of chain probe graphs
From MaRDI portal
Publication:646709
DOI10.1007/S10479-009-0584-6zbMATH Open1250.05078OpenAlexW2071792782MaRDI QIDQ646709FDOQ646709
Martin Charles Golumbic, Grégory Morel, Frédéric Maffray
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0584-6
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graph Classes: A Survey
- Graph Sandwich Problems
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Title not available (Why is that?)
- Node-Deletion Problems on Bipartite Graphs
- Difference graphs
- Characterisations and Linear-Time Recognition of Probe Cographs
- On probe interval graphs
- Probe split graphs
- Title not available (Why is that?)
- Chordal probe graphs
- A polynomial time recognition algorithm for probe interval graphs
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- 2-tree probe interval graphs have a large obstruction set
- Probe Ptolemaic Graphs
- Chordal probe graphs (extended abstract)
Cited In (5)
- On the probe problem for \((r,\ell )\)-well-coveredness
- Two characterizations of chain partitioned probe graphs
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- On the bi-enhancement of chordal-bipartite probe graphs
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
Uses Software
This page was built for publication: A characterization of chain probe graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646709)
