Pages that link to "Item:Q3694709"

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

Displaying 50 items.

• On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
• Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
• On the terminal connection problem (Q831820) (← links)
• The neighborhood polynomial of chordal graphs (Q832856) (← links)
• On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
• On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• The firefighter problem on graph classes (Q899308) (← links)
• Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
• Completely separable graphs (Q908944) (← links)
• A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
• Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
• An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
• A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• The \(\langle t \rangle \)-property of some classes of graphs (Q998518) (← links)
• Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
• On nested split graphs whose second largest eigenvalue is less than 1 (Q1014485) (← links)
• Laplacian spectrum of weakly quasi-threshold graphs (Q1014809) (← links)
• The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
• Paw-free graphs (Q1108293) (← links)
• Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
• On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
• A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
• \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
• Partial and perfect path covers of cographs (Q1281391) (← links)
• Sequential colorings and perfect graphs (Q1293205) (← links)
• Modular decomposition and transitive orientation (Q1301738) (← links)
• Enumerative aspects of certain subclasses of perfect graphs (Q1301836) (← links)
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
• On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
• A theorem on permutation graphs with applications (Q1328502) (← links)
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
• Bi-complement reducible graphs (Q1356114) (← links)
• On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
• Scattering number and modular decomposition (Q1356754) (← links)
• Generalized coloring for tree-like graphs (Q1363645) (← links)
• A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
• On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
• On-line algorithms for orders (Q1392200) (← links)
• On the structure of graphs with few \(P_4\)s (Q1392556) (← links)