Perfect Elimination and Chordal Bipartite Graphs

Cited in

(89)

Some results on connected vertex separators
On strictly chordality-$k$ graphs
On right-angled Artin groups without surface subgroups.
Dominating induced matching in some subclasses of bipartite graphs
The complexity of dissociation set problems in graphs
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Biclique graphs and biclique matrices
Chordal bipartite graphs with high boxicity
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
On recognition of threshold tolerance graphs and their complements
A note on $r$-dominating cliques
Generating bicliques of a graph in lexicographic order
Pseudo-modular graphs
Induced Matching in Some Subclasses of Bipartite Graphs
Recognition of perfect elimination bipartite graphs
Multidimensional bipartite trees
Several results on chordal bipartite graphs
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Representation characterizations of chordal bipartite graphs
Acyclic matchings in subclasses of bipartite graphs
A note on perfect Gaussian elimination
On list $k$-coloring convex bipartite graphs
On the generation of bicliques of a graph
Chordal bipartite graphs and crowns
On retracts, absolute retracts, and foldings in cographs
LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS
Graphs whose neighborhoods have no special cycles
Solving matching problems efficiently in bipartite graphs
Minimal separators in $P_4$-sparse graphs
On the bi-enhancement of chordal-bipartite probe graphs
Pushing vertices in digraphs without long induced cycles
A remark on perfect Gaussian elimination of symmetric matrices
Mobile versus point guards
Strong cliques in diamond-free graphs
A note on perfect partial elimination
Chordal bipartite graphs of bounded tree- and clique-width
Complexity of certain functional variants of total domination in chordal bipartite graphs
Feedback vertex sets on restricted bipartite graphs
Balanced Cayley graphs and balanced planar graphs
$L(2,1)$-labeling of perfect elimination bipartite graphs
Maximum weight induced matching in some subclasses of bipartite graphs
Hereditary modular graphs
Dually chordal graphs
Enumerating minimal dominating sets in chordal bipartite graphs
Perspectives of Monge properties in optimization
Decomposition of balanced matrices
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
The Dilworth number of auto-chordal bipartite graphs
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
Strongly perfect claw‐free graphs—A short proof
Bisimplicial edges in bipartite graphs
Balanced matrices
Subgraph trees in graph theory
Absolute retracts of bipartite graphs
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
On the contour of bipartite graphs
Precoloring Extension III: Classes of Perfect Graphs
Circular convex bipartite graphs: feedback vertex sets
Union closed tree convex sets
Separability generalizes Dirac's theorem
Recognizing interval digraphs and interval bigraphs in polynomial time
On the complexity of minimum maximal acyclic matchings
Large homogeneous submatrices
Recognizing threshold tolerance graphs in $O(n^2)$ time
Strong Chordality of Graphs with Possible Loops
Linear balanceable and subcubic balanceable graphs
The cyclic rank completion problem with general blocks
On groups with chordal power graph, including a classification in the case of finite simple groups
Bounds on regularity of quadratic monomial ideals
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
Decomposition of wheel-and-parachute-free balanced bipartite graphs
Typical and generic ranks in matrix completion
A Representation of bipartite graphs by digraphs and its programming application
Circular convex bipartite graphs: feedback vertex set
Recognizing sparse perfect elimination bipartite graphs
On the complexity of co-secure dominating set problem
Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
Algorithm and hardness results on hop domination in graphs
Transitivity on subclasses of bipartite graphs
Avoidable vertices and edges in graphs: existence, characterization, and applications
Beyond Helly graphs: the diameter problem on absolute retracts
Gallai-like characterization of strong cocomparability graphs
On partial Grundy coloring of bipartite graphs and chordal graphs
On the complexity of minimum maximal acyclic matchings
Bipartite Analogues of Comparability and Cocomparability Graphs
Line graphs of directed graphs. I.
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs

This page was built for publication: Perfect Elimination and Chordal Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198811)