Good characterizations and linear time recognition for 2-probe block graphs (original) (raw)
Related papers
Characterizing and recognizing probe block graphs
The complexity of clique graph recognition
Theoretical Computer Science, 2009
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics, 2012
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions
2014
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics, 2015
Characterizing Block Graphs in Terms of One-vertex Extensions
Theoretical Computer Science, 2013
Partitioning a graph into two pieces, each isomorphic to the other or to its complement
Discrete Mathematics, 2005
The path-partition problem in block graphs
Information Processing Letters, 1994
Partitioned probe comparability graphs
Theoretical Computer Science, 2008
Matemática Contemporânea, 2010
Faster algorithms for vertex partitioning problems parameterized by clique-width
Theoretical Computer Science, 2014
Faster Algorithms Parameterized by Clique-width
2013
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs
European Journal of Combinatorics, 1996
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics, 2012
2009
On the Recognition of General Partition Graphs
Graph-Theoretic Concepts in Computer Science, 2003
Parameterized Complexity of the Clique Partition Problem
2008
On the Boolean-Width of a Graph: Structure and Applications
Lecture Notes in Computer Science, 2010
On edge-sets of bicliques in graphs
Discrete Applied Mathematics, 2012
Partitions of graphs into small and large sets
Discrete Applied Mathematics, 2013
On the Parameterized Complexity of Relaxations of Clique
arXiv (Cornell University), 2023
The complexity of the independence and matching clutter of a graph
2009
Graphs of linear clique-width at most 3
Theoretical Computer Science, 2011
On Isomorphism of Graphs and the k-clique Problem
2005
Algorithm to Find All Cliques in a Graph
On Satisfactory Partitioning of Graphs
2002
Computing Cliques is Intractable
2013
Polynomial{Time Partition of a Graph into Cliques
Polynomial-time partition of a graph into cliques, 1995
Clique detection in directed graphs: a new algorithm
Journal of Computational and Applied Mathematics, 1975
A polynomial algorithm for constructing the clique graph of a line graph
Discrete Applied Mathematics, 1986
Bandwidth and density for block graphs
Discrete Mathematics, 1998