The following pages link to Efficient graph representations (Q1396949):
Displayed 50 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- On containment graphs of paths in a tree (Q324771) (← links)
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- A note on path domination (Q339493) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices (Q442351) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Decomposition by maxclique separators (Q465285) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Implicit representations and factorial properties of graphs (Q472962) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Complete branching rules for Specht modules (Q891651) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Games on interval and permutation graph representations (Q897865) (← links)