The following pages link to (Q4954442):
Displaying 50 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- The facets of the polytope of modules of a graph. (Q1412707) (← 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)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Bipartite-perfect graphs (Q1811078) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
