Characterizing and recognizing probe block graphs
DOI10.1016/J.TCS.2014.12.014zbMATH Open1315.05088OpenAlexW1986599368MaRDI QIDQ2513611FDOQ2513611
Authors: Van Bang Le, Sheng-Lung Peng 
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.014
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph designs and isomorphic decomposition (05C51)
Cites Work
- On the complexity of DNA physical mapping
- Graph Classes: A Survey
- Graph Sandwich Problems
- Algorithmic graph theory and perfect graphs
- Title not available (Why is that?)
- Probe threshold and probe trivially perfect graphs
- Block-graph width
- On probe permutation graphs
- Chordal probe graphs
- Two characterizations of chain partitioned probe graphs
- On the bi-enhancement of chordal-bipartite probe graphs
Cited In (7)
- Characterizing block graphs in terms of their vertex-induced partitions
- An observation on block graphs
- A characterization of block graphs
- A note proving the nullity of block graphs is unbounded
- Good characterizations and linear time recognition for 2-probe block graphs
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- Betti numbers of edge ideals of some split graphs
This page was built for publication: Characterizing and recognizing probe block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513611)
