Block-Graph Width (original) (raw)
Related papers
On the threshold-width of graphs
Sheng-Lung Peng, ton kloks, Ling-Ju Hung
Journal of Graph Algorithms and Applications, 2011
On the Complete Width and Edge Clique Cover Problems
Lecture Notes in Computer Science, 2015
On the Boolean-Width of a Graph: Structure and Applications
Lecture Notes in Computer Science, 2010
Exploiting restricted linear structure to cope with the hardness of clique-width
2010
Discrete Applied Mathematics, 2016
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics, 2012
On classes of graphs with logarithmic boolean-width
2016
Graphs of linear clique-width at most 3
Theoretical Computer Science, 2011
Lecture Notes in Computer Science, 2009
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics, 2015
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions
2014
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing, 1996
Complexity Results for Generating Subgraphs
Algorithmica
On the Clique-Width of Some Perfect Graph Classes
International Journal of Foundations of Computer Science, 2000
Graphs of Power-Bounded Clique-Width
Complexity results on w-well-covered graphs
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics, 2012
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
2005
Lecture Notes in Computer Science, 2009
Digraphs of bounded elimination width
Discrete Applied Mathematics, 2014
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
Theory of Computing Systems, 2000
Good characterizations and linear time recognition for 2-probe block graphs
Discrete Applied Mathematics, 2017
Partitions of graphs into small and large sets
Discrete Applied Mathematics, 2013
The path-partition problem in block graphs
Information Processing Letters, 1994
New width parameters of graphs
On the Clique-Width of Graphs with Few P
1999
Faster Algorithms Parameterized by Clique-width
2013
Beyond NP -completeness for problems of bounded width (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994