The following pages link to (Q3683903):
Displayed 50 items.
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (Q256979) (← links)
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Interval decomposition lattices are balanced (Q305165) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Peakless functions on graphs (Q678883) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- On probe permutation graphs (Q967305) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- A decomposition of distributive lattices (Q1057293) (← links)
- Schedule-induced posets (Q1081529) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Monadic second-order definable text languages (Q1361884) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)