Pages that link to "Item:Q3694709"
From MaRDI portal
The following pages link to A Linear Recognition Algorithm for Cographs (Q3694709):
Displaying 50 items.
- Triangulating multitolerance graphs (Q1392575) (← links)
- The recognition problem for line bigraphs (Q1398267) (← links)
- Handsome proof-nets: Perfect matchings and cographs (Q1398476) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (Q1675823) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Cograph generation with linear delay (Q1694670) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- Monotonicity and expansion of global secure sets (Q1761464) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Bipartite-perfect graphs (Q1811078) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Scheduling of conditional executed jobs on unrelated processors (Q1897352) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Generalizing cographs to 2-cographs (Q2111769) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
