On algorithms for (,gem)-free graphs (original) (raw)
Related papers
On Algorithms for (P5,Gem)-Free Graphs
2003
arXiv (Cornell University), 2014
Recognition and Optimization Algorithms for P5-Free Graphs
Symmetry, 2020
Discrete Applied Mathematics, 2015
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
Lecture Notes in Computer Science, 2014
A Refinement on the Structure of Vertex-Critical (P5, Gem)-Free Graphs
Social Science Research Network, 2022
The Complexity of some Problems Related to Graph 3-colorability
Discrete Applied Mathematics, 1998
On the complexity of recognizing S-composite and S-prime graphs
Discrete Applied Mathematics, 2013
Algorithms for square-3PC(.,.)-free Berge graphs
2006
The complexity of clique graph recognition
Theoretical Computer Science, 2009
Recognition Algorithm for Diamond-Free Graphs
Informatica
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Discrete Applied Mathematics, 1996
2014
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics, 2012
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms, 1987
Discrete Mathematics, 2002
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
Lecture Notes in Computer Science, 1988
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics, 2012
On the structure of (banner, odd hole)-free graphs
Journal of Graph Theory, 2018
Complexity Results for Generating Subgraphs
Algorithmica
A linear-time recognition algorithm for P 4-reducible graphs
On the complexity of some subgraph problems
Discrete Applied Mathematics, 2009
Information Processing Letters, 1988
Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
Springer eBooks, 1998
On graphs without a C4 or a diamond
Discrete Applied Mathematics, 2011
Solving the clique cover problem on (bull, C4)-free graphs
Discrete Applied Mathematics, 2018
Computational complexity of classical problems for hereditary clique-helly graphs
Pesquisa Operacional, 2004
Hardness Results and Efficient Algorithms for Graph Powers
Wg, 2009
Parallel Algorithms for Recognizing P 5 -free and -free Weakly Chordal Graphs
Parallel Processing Letters, 2004
Complexity of Coloring Graphs without Paths and Cycles
Lecture Notes in Computer Science, 2014
On the Parameterized Complexity of Relaxations of Clique
arXiv (Cornell University), 2023
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Discrete Applied Mathematics, 2015
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Discrete Applied Mathematics, 2006