Block-graph width
DOI10.1016/J.TCS.2010.10.041zbMATH Open1221.05274OpenAlexW2113596268MaRDI QIDQ534563FDOQ534563
Maw-Shang Chang, Sheng-Lung Peng, Ling-Ju Hung, Ton Kloks
Publication date: 18 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.041
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Structural characterization of families of graphs (05C75)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Graph Classes: A Survey
- Graph Sandwich Problems
- Depth-First Search and Linear Graph Algorithms
- Upper bounds to the clique width of graphs
- Rank-width and vertex-minors
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Ordering by Divisibility in Abstract Algebras
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- A Characterization of Certain Ptolemaic Graphs
- On probe interval graphs
- Letter graphs and well-quasi-order by induced subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioned probe comparability graphs
- On probe permutation graphs
Cited In (9)
- Block-Graph Width
- On the complete width and edge clique cover problems
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- A note proving the nullity of block graphs is unbounded
- Characterizing and recognizing probe block graphs
- On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph
- Good characterizations and linear time recognition for 2-probe block graphs
- Trivially-perfect width
- On some FPT problems without polynomial Turing compressions
This page was built for publication: Block-graph width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534563)
