Completely separable graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3315022 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Combinatorial Decomposition Theory
- A Linear Recognition Algorithm for Cographs
- Distance-hereditary graphs
- On a property of the class of n-colorable graphs
- On brittle graphs
- Parity Graphs
- Recognizing circle graphs in polynomial time
- Topics on perfect graphs
- Which claw-free graphs are perfectly orderable?
Cited in
(75)- MAD trees and distance-hereditary graphs
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- Distance-hereditary digraphs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Graphs with bounded induced distance
- On coloring problems with local constraints
- Separable discrete functions: recognition and sufficient conditions
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Graphs of separability at most 2
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- The bi-join decomposition
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Paired-domination problem on distance-hereditary graphs
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Distance-hereditary comparability graphs
- Dominating cliques in distance-hereditary graphs
- (k,+)-distance-hereditary graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Distance approximating spanning trees
- Knocking out \(P_k\)-free graphs
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- Probe Ptolemaic Graphs
- Distance labeling scheme and split decomposition
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Homogeneously orderable graphs
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Networks with small stretch number
- On the clique-width of some perfect graph classes
- Word-representability of graphs with respect to split recomposition
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Solving some NP-complete problems using split decomposition
- Clique-width with an inactive label
- Practical and efficient split decomposition via graph-labelled trees
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Make a graph singly connected by edge orientations
- Separable and equatable hypergraphs
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Finding a sun in building-free graphs
- Treelike comparability graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Equistable distance-hereditary graphs
- Rebuilding convex sets in graphs
- PLA folding in special graph classes
- Unique response Roman domination: complexity and algorithms
- Weighted efficient domination problem on some perfect graphs
- scientific article; zbMATH DE number 726921 (Why is no real title available?)
- On the separability of graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Domination graphs: Examples and counterexamples
- On computing the Galois lattice of bipartite distance hereditary graphs
- Succinct data structures for bounded clique-width graphs
- Powers of distance-hereditary graphs
- Bipartite almost distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
- Comparing the metric and strong dimensions of graphs
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Domination in distance-hereditary graphs
- Segre's hemisystem and McLaughlin's graph
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
- Clique-width of graphs defined by one-vertex extensions
- Laminar structure of ptolemaic graphs with applications
- The Hamiltonian problem on distance-hereditary graphs
- Distance-hereditary comparability graphs
- Homogeneously orderable graphs and the Steiner tree problem
- Computing maximum stable sets for distance-hereditary graphs
- Eternal connected vertex cover problem in graphs: complexity and algorithms
- LexBFS-orderings and powers of graphs
- On coloring problems with local constraints
This page was built for publication: Completely separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908944)
