Graphs of separability at most 2
From MaRDI portal
Publication:415268
Recommendations
- Graphs of separability at most two: structural characterizations and their consequences
- On the separability of graphs
- Completely separable graphs
- scientific article; zbMATH DE number 702861
- Entangled Graphs
- On the separation number of a graph
- Graphs with disjoint \(2\)-dominating sets
- On separated graphs with certain regularity conditions
- Path Separability of Graphs
- scientific article; zbMATH DE number 861319
Cites work
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A mickey-mouse decomposition theorem
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- A theorem of Truemper
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Claw-free graphs. IV: Decomposition theorem
- Decomposition by clique separators
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Edge dominating set and colorings on graphs with fixed clique-width
- Even and odd holes in cap-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Even-hole-free graphs. I: Decomposition theorem
- Graphs of separability at most two: structural characterizations and their consequences
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle-rewriting hypergraph grammars
- Isomorphism of graphs which are pairwise k-separable
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- On graphs with polynomially solvable maximum-weight clique problem
- On rigid circuit graphs
- On the Relationship Between Clique-Width and Treewidth
- On the clique-width of graph with few \(P_{4}\)'s
- Some simplified NP-complete graph problems
- The strong perfect graph theorem
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- Universally signable graphs
Cited in
(13)- Learning unfaithful \(K\)-separable Gaussian graphical models
- Graphs of separability at most two: structural characterizations and their consequences
- Algorithmic results on locating-total domination in graphs
- The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs
- Segre's hemisystem and McLaughlin's graph
- Hereditary efficiently dominatable graphs
- Completely separable graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- On the separability of graphs
- The expansion of polynomial invariants for $2$-decompositions of generalized graphs
- Partial characterizations of 1-perfectly orientable graphs
- Secure total domination in graphs: bounds and complexity
- Substitution and \(\chi\)-boundedness
This page was built for publication: Graphs of separability at most 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415268)
