Pages that link to "Item:Q3694709"
From MaRDI portal
The following pages link to A Linear Recognition Algorithm for Cographs (Q3694709):
Displaying 50 items.
- Pattern matching for permutations (Q293263) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← 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)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Edge search number of cographs (Q415273) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← 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)
- Acyclic and star colorings of cographs (Q643025) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
