The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- Binomial edge ideals of cographs (Q5880895) (← links)
- Polar cographs (Q5899394) (← links)
- Polar cographs (Q5900347) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Graph transformations preserving the stability number (Q5916099) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Edge clique covers in graphs with independence number two (Q6055943) (← links)
- Almost controllable graphs and beyond (Q6056472) (← links)
- Graphon convergence of random cographs (Q6074665) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- Classification of non-solvable groups whose power graph is a cograph (Q6110526) (← links)
- Reducing graph parameters by contractions and deletions (Q6119833) (← links)
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints (Q6124916) (← links)
- Enumerating Independent Linear Inferences (Q6135760) (← links)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic (Q6137849) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Laplacian eigenvalues of equivalent cographs (Q6160542) (← links)
- Confining the robber on cographs (Q6165484) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
- New results on complementarity spectra of connected graphs (Q6166661) (← links)
- Laplacian spectra of cographs: a twin reduction perspective (Q6168552) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Cographs and 1-sums (Q6184155) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
- Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract) (Q6567669) (← links)
- Mutual-visibility problems on graphs of diameter two (Q6568863) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)
- Fitch graph completion (Q6591635) (← links)
- Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs (Q6592900) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
