Pages that link to "Item:Q3694709"

The following pages link to A Linear Recognition Algorithm for Cographs (Q3694709):

Displaying 42 items.

• (Q5708545) (← links)
• (Q5708621) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902515) (← links)
• On perfect switching classes (Q5906340) (← links)
• Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
• Parameterized aspects of triangle enumeration (Q5915757) (← links)
• Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• Partitioning a graph into complementary subgraphs (Q5918340) (← links)
• Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
• The largest connected subgraph game (Q5918781) (← links)
• The largest connected subgraph game (Q5925553) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
• A note on \(\alpha\)-redundant vertices in graphs (Q5929313) (← links)
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
• Efficient recognition algorithms for boundary and linear eNCE graph languages (Q5941743) (← links)
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
• On perfect switching classes (Q5967036) (← links)
• On the computational difficulty of the terminal connection problem (Q6041044) (← links)
• The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
• Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
• Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints (Q6124916) (← links)
• Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
• Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
• New results on complementarity spectra of connected graphs (Q6166661) (← links)
• Cographs and 1-sums (Q6184155) (← links)
• Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)
• Computing and listing avoidable vertices and paths (Q6185944) (← links)
• Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)
• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
• Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)
• Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
• Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions (Q6561585) (← links)
• Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)
• Fitch graph completion (Q6591635) (← links)
• Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs (Q6592900) (← links)
• A linear algorithm for obtaining the Laplacian eigenvalues of a cograph (Q6646723) (← links)
• Characterizations of graph classes via convex geometries: a survey (Q6648266) (← links)