Strongly chordal and chordal bipartite graphs are sandwich monotone
type: Item
instance of: scholarly article
title: Strongly chordal and chordal bipartite graphs are sandwich monotone
zbMATH Open document ID: 1230.90161
author: Pinar Heggernes
author: F. Mancini
author: Charis Papadopoulos
author: R. Sritharan
published in: Journal of Combinatorial Optimization
publication date: 2011-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5988543
zbMATH Keywords: minimal completions
zbMATH Keywords: sandwich monotonicity
zbMATH Keywords: strongly chordal graphs
zbMATH Keywords: chordal bipartite graphs
MaRDI profile type: Publication
full work available at URL: s10878-010-9322-x
OpenAlex ID: W1986338131
cites work: Every monotone graph property is testable
cites work: Several results on chordal bipartite graphs
cites work: Measures on monotone properties of graphs
cites work: Safe separators for treewidth
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
cites work: On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
cites work: Characterizations of strongly chordal graphs
cites work: Exact Algorithms for Treewidth and Minimum Fill-In
cites work: Algorithmic graph theory and perfect graphs
cites work: Minimal split completions
cites work: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
cites work: Characterizing Minimal Interval Completions
cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
cites work: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
cites work: Characterizing and Computing Minimal Cograph Completions
cites work: Complexity classification of some edge modification problems
cites work: Three Partition Refinement Algorithms
cites work: Triangulated graphs and the elimination process
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Doubly lexical ordering of dense 0--1 matrices
cites work: Chordal bipartite completion of colored graphs
cites work: Computing the Minimum Fill-In is NP-Complete
DOI: 10.1007/S10878-010-9322-X
description: scientific article; zbMATH DE number 5988543