Characterizations of totally balanced matrices
From MaRDI portal
Recommendations
Cited in
(69)- Strong Chordality of Graphs with Possible Loops
- Large homogeneous submatrices
- Totally-Balanced and Greedy Matrices
- A polyhedral view to a generalization of multiple domination
- Broadcast domination and multipacking in strongly chordal graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Equivalence between hypergraph convexities
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Perfect circular arc coloring
- Labeling algorithms for domination problems in sun-free chordal graphs
- Efficient \((j, k)\)-dominating functions
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- A characterization of totally balanced hypergraphs
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- The domatic number problem on some perfect graph families
- Structural properties and decomposition of linear balanced matrices
- Optimal design of line replaceable units
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- A note on perfectly orderable graphs
- On hypergraph acyclicity and graph chordality
- Incidence graphs of biacyclic hypergraphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Gallai-like characterization of strong cocomparability graphs
- A note on odd/even cycles
- L(2,1)-labeling of perfect elimination bipartite graphs
- Min-orderable digraphs
- Some recent results in the analysis of greedy algorithms for assignment problems
- Decomposition of wheel-and-parachute-free balanced bipartite graphs
- Complexity of distance paired-domination problem in graphs
- On strictly chordality-\(k\) graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- Comparability digraphs: an analogue of comparability graphs
- Clique graphs and Helly graphs
- Computing simple-path convex hulls in hypergraphs
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths
- Bipartite Analogues of Comparability and Cocomparability Graphs
- \(k\)-tuple domination in graphs
- Balanced matrices
- Interval-like graphs and digraphs
- Dually chordal graphs
- Binary set systems and totally balanced hypergraphs
- Totally balanced and totally unimodular matrices defined by center location problems
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- Which claw-free graphs are strongly perfect?
- Totally Balanced Formal Context Representation
- Doubly lexical ordering of dense 0--1 matrices
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Probe Matrix Problems: Totally Balanced Matrices
- Chordal bipartite graphs of bounded tree- and clique-width
- Totally balanced dissimilarities
- Decomposition of balanced matrices
- Which claw-free graphs are perfectly orderable?
- Optimisation and hypergraph theory
- A decomposition strategy for the vertex cover problem
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Convexity in Graphs and Hypergraphs
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis
- The multiple domination and limited packing problems in graphs
- General forbidden configuration theorems
- Classes of bipartite graphs related to chordal graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
- Rainbow domination and related problems on strongly chordal graphs
- On balanced graphs
- Permuting matrices to avoid forbidden submatrices
This page was built for publication: Characterizations of totally balanced matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344216)
