Pages that link to "Item:Q3694709"
From MaRDI portal
The following pages link to A Linear Recognition Algorithm for Cographs (Q3694709):
Displaying 50 items.
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- The niche graphs of bipartite tournaments (Q2185734) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
- Some new classes of open distance-pattern uniform graphs (Q2248722) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Note on the perfect Roman domination number of graphs (Q2284084) (← links)
- On the Letac-Massam conjecture and existence of high dimensional Bayes estimators for graphical models (Q2293718) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- On the double Roman domination of graphs (Q2335792) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- Secure domination in cographs (Q2416434) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Asymptotic enumeration of cographs (Q2741466) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
