Pages that link to "Item:Q2395457"
From MaRDI portal
The following pages link to Incidence matrices and interval graphs (Q2395457):
Displayed 50 items.
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Tree loop graphs (Q876466) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Homotopy equivalence in finite digital images (Q892819) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Bruhat order, smooth Schubert varieties, and hyperplane arrangements (Q958724) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A characterization of signed graphs with generalized perfect elimination orderings (Q965961) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- A new characterization of matrices with the consecutive ones property (Q967442) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- On split-coloring problems (Q995923) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- A characterization of cycle-free unit probe interval graphs (Q1028472) (← links)
- Estimating high-dimensional intervention effects from observational data (Q1043733) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Some remarks on interval graphs (Q1050372) (← links)
- Properties of (0,1)-matrices with no triangles (Q1054733) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Asymptotically optimal weighing designs with string property (Q1062397) (← links)
- Testing for class membership in multi-parent hierarchies (Q1107299) (← links)
- Fuzzy intersection graphs (Q1107547) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- A class of lattices with Möbius function \(\pm 1,0\) (Q1115893) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- Extremal values of the interval number of a graph. II (Q1145706) (← links)
- Extremal values of the interval number of a graph, II (Q1149452) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- Inheritance principles for chordal graphs (Q1173947) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)