The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Detour trees (Q277622) (← links)
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- Finding pattern matchings for permutations (Q290212) (← links)
- Pattern matching for permutations (Q293263) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- On CIS circulants (Q394314) (← links)
- Edge search number of cographs (Q415273) (← links)
- Four-cycled graphs with topological applications (Q434228) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- On the geodeticity of the contour of a graph (Q479045) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
- On Hadamard diagonalizable graphs (Q551311) (← links)
- Completion of Laplacian integral graphs via edge addition (Q556838) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Enumeration of point-determining graphs (Q618313) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- On the structure of strong 3-quasi-transitive digraphs (Q708416) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
