Separability generalizes Dirac's theorem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Decomposition by clique separators
- Incidence matrices and interval graphs
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- On rigid circuit graphs
- On the semi-perfect elimination
- Perfect Elimination and Chordal Bipartite Graphs
- Representation of a finite graph by a set of intervals on the real line
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Some aspects of perfect elimination orderings in chordal graphs
Cited in
(31)- Asteroidal triples of moplexes
- Separator orders in interval, cocomparability, and AT-free graphs
- Robinsonian matrices: recognition challenges
- Organizing the atoms of the clique separator decomposition into an atom tree
- Bisimplicial separators
- Minimal proper interval completions
- Minimal interval completion through graph exploration
- Representing a concept lattice by a graph
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Graphs with at most two moplexes
- Finding biclique partitions of co-chordal graphs
- Minimal triangulations of graphs: a survey
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Graph extremities defined by search algorithms
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Computing and listing avoidable vertices and paths
- The separability ‘‘theorem’’ in terms of distributions with discussion of electromagnetic scattering theory
- Shifting paths to avoidable ones
- Computing a clique tree with the algorithm maximal label search
- Graph searches and their end vertices
- Moplex orderings generated by the LexDFs algorithm
- Moplex elimination orderings
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Junction trees of general graphs
- Avoidable paths in graphs
- Computing and listing avoidable vertices and paths
- Extremities and orderings defined by generalized graph search algorithms
- Vertex elimination orderings for hereditary graph classes
This page was built for publication: Separability generalizes Dirac's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392561)
