A Linear Recognition Algorithm for Cographs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The cluster deletion problem for cographs
- On perfect switching classes
- Algorithmic aspects of clique-transversal and clique-independent sets
- A fast parallel algorithm to recognize P4-sparse graphs
- Secure domination in cographs
- Fast winning strategies for the attacker in eternal domination
- Asymptotic enumeration of cographs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Fully dynamic recognition algorithm and certificate for directed cographs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Complexity results on cosecure domination in graphs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Independent set reconfiguration in cographs and their generalizations
- Characterizing and computing minimal cograph completions
- On the double Roman domination of graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- On retracts, absolute retracts, and foldings in cographs
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Graphs with No Induced Five‐Vertex Path or Antipath
- On independent vertex sets in subclasses of apple-free graphs
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- On-line algorithms for orders
- On the terminal connection problem
- The neighborhood polynomial of chordal graphs
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Efficient parallel recognition of cographs
- scientific article; zbMATH DE number 7561323 (Why is no real title available?)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Choosability of P 5-Free Graphs
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- Further results on the hunters and rabbit game through monotonicity
- The recognition problem for line bigraphs
- On the spectrum of threshold graphs
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Extending the MAX algorithm for maximum independent set
- On the parameterized complexity of odd coloring
- Generalizing cographs to 2-cographs
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- The Neighborhood Polynomial of Chordal Graphs
- Cograph editing: Merging modules is equivalent to editing P₄s
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- On graphs without a \(C_{4}\) or a diamond
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- When can graph hyperbolicity be computed in linear time?
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
- Handsome proof-nets: Perfect matchings and cographs
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- Finding a potential community in networks
- Coupon coloring of cographs
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- On the computational difficulty of the terminal connection problem
- A characterization of claw-free \(b\)-perfect graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- The graph sandwich problem for P₄-sparse graphs
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Edge search number of cographs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- On switching classes, NLC-width, cliquewidth and treewidth
- Graphs of linear clique-width at most 3
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
- On variations of \(P_{4}\)-sparse graphs
- Edge Search Number of Cographs in Linear Time
- Bi-complement reducible graphs
- Eigenvalue location in cographs
- Stability, vertex stability, and unfrozenness for special graph classes
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- 2-polarity and algorithmic aspects of polarity variants on cograph superclasses
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Fixed-parameter algorithms for the cocoloring problem
- Detecting and counting small pattern graphs
- Strong triadic closure in cographs and graphs of low maximum degree
- Characterisations and Linear-Time Recognition of Probe Cographs
- Recognition of prime graphs from a prime subgraph
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- Vertex disjoint paths on clique-width bounded graphs
- On nested split graphs whose second largest eigenvalue is less than 1
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Partial and perfect path covers of cographs
- The largest connected subgraph game
- \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
- On the stable set problem in special \(P_{5}\)-free graphs
- Solving NP-hard problems on \textsc{GaTEx} graphs: linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
- Completely separable graphs
- Pattern matching for permutations
- Acyclic and star colorings of cographs
- Modular decomposition and transitive orientation
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Fitch graph completion
- Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
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)
