Perfect Elimination and Chordal Bipartite Graphs

Cited in

(99)

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