Strong cliques and equistability of EPT graphs
From MaRDI portal
Publication:260014
DOI10.1016/j.dam.2015.09.016zbMath1332.05042OpenAlexW1798473150MaRDI QIDQ260014
F. Blanchet-Sadri, M. Dambrine
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.016
Paths and cycles (05C38) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Short proofs on the structure of general partition, equistable and triangle graphs ⋮ Strong cliques in diamond-free graphs ⋮ Detecting strong cliques ⋮ Decomposing 1-Sperner hypergraphs
Cites Work
- Equistarable bipartite graphs
- On equistable, split, CIS, and related classes of graphs
- Complexity results for equistable graphs and related classes
- A simplified NP-complete satisfiability problem
- The edge intersection graphs of paths in a tree
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Intersection models of weakly chordal graphs
- A superclass of edge-path-tree graphs with few cliques
- Integrality properties of edge path tree families
- Edge and vertex intersection of paths in a tree
- Triangulated edge intersection graphs of paths in a tree
- Decomposition by clique separators
- Intersection graphs of paths in a tree
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Equistable series-parallel graphs
- Equistable chordal graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Threshold graphs and related topics
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- On the complexity of the independent set problem in triangle graphs
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Recognizing Helly edge-path-tree graphs and their clique graphs
- A characterization and hereditary properties for partition graphs
- Recent examples in the theory of partition graphs
- Equistable simplicial, very well-covered, and line graphs
- Equistable distance-hereditary graphs
- Representing edge intersection graphs of paths on degree 4 trees
- Recognizing k-equistable Graphs in FPT Time
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
- Equistable graphs
- Faster scaling algorithms for general graph matching problems
- On the Recognition of k-Equistable Graphs
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong cliques and equistability of EPT graphs
