Pages that link to "Item:Q2395457"
From MaRDI portal
The following pages link to Incidence matrices and interval graphs (Q2395457):
Displayed 50 items.
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Structure of concurrency (Q685384) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Basic derivations for subarrangements of Coxeter arrangements (Q687005) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Optimal weighing designs with a string property (Q792048) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Inducing a blockmodel structure of two-mode binary data using seriation procedures (Q856645) (← links)
- Alexandrov's inequality and conjectures on some Toeplitz matrices (Q869926) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Tree loop graphs (Q876466) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← 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)
- 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)
- 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)