Pages that link to "Item:Q3694709"

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

Displaying 50 items.

• Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (Q2846474) (← links)
• Vertex partitions of graphs into cographs and stars (Q2874091) (← links)
• Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308) (← links)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
• Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
• Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
• Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
• Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
• Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
• Miscellaneous Digraph Classes (Q3120443) (← links)
• (Q3121527) (← links)
• Choosability of P 5-Free Graphs (Q3182940) (← links)
• On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
• Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
• <i>P</i>₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849) (← links)
• Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
• Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
• Path-Bicolorable Graphs (Q3655151) (← links)
• (Q3676177) (← links)
• A good characterization of cograph contractions (Q4238044) (← links)
• The searchlight guarding problem on weighted split graphs and weighted cographs (Q4488859) (← links)
• -cospectrality and -energy in cographs (Q4640076) (← links)
• (Q4691781) (← links)
• (Q4691867) (← links)
• Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
• Secure total domination in chain graphs and cographs (Q4956172) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• The pathwidth and treewidth of cographs (Q5056112) (← links)
• Parallel algorithm for cograph recognition with applications (Q5056132) (← links)
• Pattern matching for permutations (Q5060113) (← links)
• Acyclic polynomials of graphs (Q5080911) (← links)
• (Q5090953) (← links)
• (Q5090996) (← links)
• The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements (Q5099105) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
• BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION (Q5249025) (← links)
• <font>NLC</font>₂-DECOMPOSITION IN POLYNOMIAL TIME (Q5249046) (← links)
• Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
• Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
• Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
• A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS (Q5696896) (← links)
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
• (Q5708507) (← links)