Pages that link to "Item:Q4198811"
From MaRDI portal
The following pages link to Perfect Elimination and Chordal Bipartite Graphs (Q4198811):
Displayed 50 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- A note on perfect partial elimination (Q389218) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Balanced Cayley graphs and balanced planar graphs (Q712243) (← links)
- Graphs whose neighborhoods have no special cycles (Q798333) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- On right-angled Artin groups without surface subgroups. (Q965090) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Chordal bipartite graphs and crowns (Q1071029) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- A remark on perfect Gaussian elimination of symmetric matrices (Q1262880) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Multidimensional bipartite trees (Q1415538) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Mobile versus point guards (Q1716007) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Absolute retracts of bipartite graphs (Q1820174) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Recognition of perfect elimination bipartite graphs (Q1836480) (← links)
- Decomposition of wheel-and-parachute-free balanced bipartite graphs (Q1900140) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Bounds on regularity of quadratic monomial ideals (Q2194763) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)