The following pages link to (Q3676177):
Displaying 50 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- The micro-world of cographs (Q831855) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Cograph generation with linear delay (Q1694670) (← links)
- Graph approach to solving problems of combinatorial recognition (Q1699396) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- Asymptotic enumeration of cographs (Q2741466) (← links)
- Recognition of unigraphs through superposition of graphs (Q2865028) (← links)
- An algorithm to recognize a generalized line graph and output its root graph (Q3360912) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- A Linear Recognition Algorithm for Cographs (Q3694709) (← links)
- A good characterization of cograph contractions (Q4238044) (← links)
- The searchlight guarding problem on weighted split graphs and weighted cographs (Q4488859) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
