Graphs of separability at most 2
DOI10.1016/J.DAM.2011.01.016zbMATH Open1241.05142OpenAlexW1968107207MaRDI QIDQ415268FDOQ415268
Authors: Ferdinando Cicalese, Martin Milanič 
Publication date: 11 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.016
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
decompositioninduced subgraphseparabilityhereditary classinduced minorparsimony haplotypingseparating clique
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition by clique separators
- Linear time solvable optimization problems on graphs of bounded clique-width
- Handle-rewriting hypergraph grammars
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- On the Relationship Between Clique-Width and Treewidth
- Title not available (Why is that?)
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- On rigid circuit graphs
- The strong perfect graph theorem
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Some simplified NP-complete graph problems
- Handbook of Graph Grammars and Computing by Graph Transformation
- Title not available (Why is that?)
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- On graphs with polynomially solvable maximum-weight clique problem
- Claw-free graphs. IV: Decomposition theorem
- Edge dominating set and colorings on graphs with fixed clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Universally signable graphs
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- A theorem of Truemper
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Even-hole-free graphs. I: Decomposition theorem
- Graphs of separability at most two: structural characterizations and their consequences
- Title not available (Why is that?)
- Isomorphism of graphs which are pairwise k-separable
- Even and odd holes in cap-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mickey-mouse decomposition theorem
Cited In (12)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs
- Completely separable graphs
- The expansion of polynomial invariants for $2$-decompositions of generalized graphs
- Title not available (Why is that?)
- Hereditary Efficiently Dominatable Graphs
- Graphs of separability at most two: structural characterizations and their consequences
- Substitution and \(\chi\)-boundedness
- Algorithmic results on locating-total domination in graphs
- Partial Characterizations of 1‐Perfectly Orientable Graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Secure total domination in graphs: bounds and complexity
- Segre's hemisystem and McLaughlin's graph
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)
