The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 43 items.
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Gallai-Ramsey numbers involving a rainbow 4-path (Q6045136) (← links)
- MaxCut on permutation graphs is NP‐complete (Q6047965) (← links)
- Properly colored cycles of different lengths in edge-colored complete graphs (Q6056740) (← links)
- Edge‐colored complete graphs without properly colored even cycles: A full characterization (Q6056775) (← links)
- Gallai–Ramsey number for K5 ${K}_{5}$ (Q6057638) (← links)
- The multicolor star-critical Gallai-Ramsey number for a path of order 5 (Q6063849) (← links)
- Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- The Erdős–Gyárfás function with respect to Gallai‐colorings (Q6081587) (← links)
- Complete bipartite graphs without small rainbow stars (Q6094708) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← links)
- Edge-disjoint properly colored cycles in edge-colored complete graphs (Q6126721) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Partial and simultaneous transitive orientations via modular decompositions (Q6130330) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
- Size Gallai-Ramsey number (Q6143692) (← links)
- Complete bipartite graphs without small rainbow subgraphs (Q6153477) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
- Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles (Q6180566) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
- F3-Reconstruction and Bi-Founded 2-Structures (Q6493758) (← links)
- Semi-strict chordality of digraphs (Q6540642) (← links)
- Gallai-Ramsey numbers of books (Q6542041) (← links)
- The Gallai and anti-Gallai graphs of strongly regular graphs (Q6557990) (← links)
- On the Weisfeiler-Leman dimension of permutation graphs (Q6561325) (← links)
- Hereditary classes of ordered sets of width at most two (Q6563997) (← links)
- Some progress on the Aharoni-Korman conjecture (Q6570054) (← links)
- Extending partial representations of circle graphs in near-linear time (Q6582371) (← links)
- Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
- Gallai-Ramsey number for complete graphs (Q6604691) (← links)
- Minimum-degree conditions for rainbow triangles (Q6606322) (← links)
- Word-representability of graphs with respect to split recomposition (Q6611031) (← links)
- Gallai-Ramsey numbers for paths (Q6640957) (← links)
- Computing shortest 12-representants of labeled graphs (Q6644892) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
- Ramsey and Gallai-Ramsey numbers for comb and sun graphs (Q6657270) (← links)
- On dually-CPT and strongly-CPT posets (Q6663924) (← links)
- On non-superperfection of edge intersection graphs of paths (Q6670498) (← links)
