The following pages link to (Q3128916):
Displaying 50 items.
- Computing a poset from its realizer (Q287260) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- The facets of the polytope of modules of a graph. (Q1412707) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Counting independent sets in cocomparability graphs (Q1721932) (← 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)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- On the toll number of a graph (Q2172405) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
