The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← 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)
- Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- On \(m\)-centers in \(P_ t\)-free graphs (Q1322266) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- PLA folding in special graph classes (Q1329804) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- Matroids arisen from matrogenic graphs (Q1356745) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Subgraph trees in graph theory (Q1406544) (← 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)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Permutations, parenthesis words, and Schröder numbers (Q1584395) (← links)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Multiplicity of eigenvalues of cographs (Q1671311) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (Q1675823) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs (Q1690677) (← links)
- Cograph generation with linear delay (Q1694670) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Induced saturation of graphs (Q1727803) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- The chromatic symmetric functions of trivially perfect graphs and cographs (Q1756046) (← links)
- Monotonicity and expansion of global secure sets (Q1761464) (← links)
