A Linear Recognition Algorithm for Cographs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On nested split graphs whose second largest eigenvalue is less than 1
- Laplacian spectrum of weakly quasi-threshold graphs
- The graph sandwich problem for P₄-sparse graphs
- Dynamically maintaining split graphs
- Laminar structure of ptolemaic graphs with applications
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Paw-free graphs
- Strong tree-cographs are Birkhoff graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- \(P_ 4\)-trees and substitution decomposition
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Triangulating graphs with few \(P_4\)'s
- Partial and perfect path covers of cographs
- Sequential colorings and perfect graphs
- Modular decomposition and transitive orientation
- Enumerative aspects of certain subclasses of perfect graphs
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- On cocolourings and cochromatic numbers of graphs
- A theorem on permutation graphs with applications
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Bi-complement reducible graphs
- On semi-\(P_ 4\)-sparse graphs
- Scattering number and modular decomposition
- Generalized coloring for tree-like graphs
- A fast parallel algorithm to recognize P4-sparse graphs
- On extended P₄-reducible and extended P₄-sparse graphs
- On-line algorithms for orders
- On the structure of graphs with few P₄s
- Triangulating multitolerance graphs
- The recognition problem for line bigraphs
- Handsome proof-nets: Perfect matchings and cographs
- On variations of \(P_{4}\)-sparse graphs
- Stability number of bull- and chair-free graphs revisited
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- Stable sets in two subclasses of banner-free graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
- Approximating weighted neighborhood independent sets
- Locally identifying coloring of graphs with few P4s
- Cograph generation with linear delay
- The secure domination problem in cographs
- Finding a potential community in networks
- Coupon coloring of cographs
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- On retracts, absolute retracts, and foldings in cographs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Eigenvalue location in cographs
- Monotonicity and expansion of global secure sets
- Tree decompositions with small cost
- On the structure of (\(P_{5}\),\,gem)-free graphs
- A simple linear time algorithm for cograph recognition
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- On some graphs with a unique perfect matching
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Bipartite-perfect graphs
- The clique operator on cographs and serial graphs
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- On the stable set problem in special \(P_{5}\)-free graphs
- Scheduling of conditional executed jobs on unrelated processors
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- An optimal path cover algorithm for cographs
- Quasi-threshold graphs
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Upper bounds to the clique width of graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Indirect identification of horizontal gene transfer
- Detecting and enumerating small induced subgraphs in c-closed graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Convex geometries over induced paths with bounded length
- On the properties of weighted minimum colouring games
- Generalizing cographs to 2-cographs
- Linear-time minimal cograph editing
- New results on independent sets in extensions of \(2K_2\)-free graphs
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs
- The niche graphs of bipartite tournaments
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Distance eigenvalues of a cograph and their multiplicities
- Some new classes of open distance-pattern uniform graphs
- Partitioning a graph into convex sets
- Note on the perfect Roman domination number of graphs
- On the Letac-Massam conjecture and existence of high dimensional Bayes estimators for graphical models
- Reciprocal best match graphs
- A multivariate analysis of the strict terminal connection problem
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Perfect Roman domination in graphs
- On the double Roman domination of graphs
- Extending the MAX algorithm for maximum independent set
- New sufficient conditions for \(\alpha\)-redundant vertices
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Knocking out \(P_k\)-free graphs
- On computing the Galois lattice of bipartite distance hereditary graphs
This page was built for publication: A Linear Recognition Algorithm for Cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694709)
