Strong cliques and equistability of EPT graphs
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Recommendations
- Equivalent and strong equivalent graphs with application in clustering
- Strong cliques in vertex‐transitive graphs
- Strong cliques in claw-free graphs
- Strong cliques in diamond-free graphs
- Strong cliques in diamond-free graphs
- Clique graph characterizations of strongly chordal graphs
- scientific article; zbMATH DE number 1161246
- Strong cliques and stable sets
- \(t\)-strong cliques and the degree-diameter problem
- On the clique number of a strongly regular graph
Cites work
- scientific article; zbMATH DE number 4139799 (Why is no real title available?)
- scientific article; zbMATH DE number 4068928 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 4123780 (Why is no real title available?)
- scientific article; zbMATH DE number 1076150 (Why is no real title available?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A characterization and hereditary properties for partition graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- A simplified NP-complete satisfiability problem
- A superclass of edge-path-tree graphs with few cliques
- Complexity results for equistable graphs and related classes
- Decomposition by clique separators
- Edge and vertex intersection of paths in a tree
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Equistable chordal graphs
- Equistable distance-hereditary graphs
- Equistable graphs
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Equistable series-parallel graphs
- Equistable simplicial, very well-covered, and line graphs
- Equistarable bipartite graphs
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- Faster scaling algorithms for general graph matching problems
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Graph theory
- Graph-Theoretic Concepts in Computer Science
- Integrality properties of edge path tree families
- Intersection graphs of paths in a tree
- Intersection models of weakly chordal graphs
- On equistable, split, CIS, and related classes of graphs
- On partition graphs
- On the complexity of the independent set problem in triangle graphs
- On the recognition of \(k\)-equistable graphs
- Recent examples in the theory of partition graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Recognizing \(k\)-equistable graphs in FPT time
- Representing edge intersection graphs of paths on degree 4 trees
- The edge intersection graphs of paths in a tree
- Threshold graphs and related topics
- Triangulated edge intersection graphs of paths in a tree
Cited in
(5)
This page was built for publication: Strong cliques and equistability of EPT graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260014)
