Two characterizations of chain partitioned probe graphs

DOI10.1007/s10479-010-0749-3zbMath1250.05081OpenAlexW1644319402MaRDI QIDQ646714

Van Bang Le

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-010-0749-3

zbMATH Keywords

combinatorial problemsindependent setchain graphschain partitioned probe graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Good characterizations and linear time recognition for 2-probe block graphs ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Characterizing and recognizing probe block graphs

Cites Work

• A characterization of chain probe graphs
• On the bi-enhancement of chordal-bipartite probe graphs
• Probe threshold and probe trivially perfect graphs
• Chordal probe graphs
• Node-Deletion Problems on Bipartite Graphs
• Graph Classes: A Survey
• Graph Sandwich Problems
• Difference graphs

This page was built for publication: Two characterizations of chain partitioned probe graphs