The following pages link to Completely separable graphs (Q908944):
Displaying 23 items.
- Separable and equatable hypergraphs (Q2696627) (← links)
- Distance-hereditary comparability graphs (Q2840542) (← links)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
- The bi-join decomposition (Q3439330) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- (Q5009491) (← links)
- Distance approximating spanning trees (Q5048949) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6547830) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
- Word-representability of graphs with respect to split recomposition (Q6611031) (← links)
