Strong cliques and equistability of EPT graphs
DOI10.1016/J.DAM.2015.09.016zbMATH Open1332.05042OpenAlexW1798473150MaRDI QIDQ260014FDOQ260014
Authors: L. Alcón, M. Gutierrez, István Kovács, Martin Milanič, Romeo Rizzi 
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
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
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)
Cites Work
- Graph theory
- 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
- Equistarable bipartite graphs
- Recognizing \(k\)-equistable graphs in FPT time
- A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- On equistable, split, CIS, and related classes of graphs
- Title not available (Why is that?)
- On partition graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equistable graphs
- Faster scaling algorithms for general graph matching problems
- Title not available (Why is that?)
- On the recognition of \(k\)-equistable graphs
- Graph-Theoretic Concepts in Computer Science
- 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
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)
