Pages that link to "Item:Q1392561"
From MaRDI portal
The following pages link to Separability generalizes Dirac's theorem (Q1392561):
Displaying 31 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Junction trees of general graphs (Q2519354) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Moplex elimination orderings (Q2816011) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH (Q5249047) (← links)
- The separability ‘‘theorem’’ in terms of distributions with discussion of electromagnetic scattering theory (Q5284888) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- Finding biclique partitions of co-chordal graphs (Q6162046) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- Bisimplicial separators (Q6565812) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
