The following pages link to Block-graph width (Q534563):
Displaying 5 items.
- On the complete width and edge clique cover problems (Q721937) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Characterizing and recognizing probe block graphs (Q2513611) (← links)
