The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- The minimal non-\((\leqslant k)\)-reconstructible relations (Q1772265) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- Graphic topology on tournaments (Q1793973) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Extension of hereditary classes with substitutions (Q1811128) (← links)
- Invariants of finite comparability graphs (Q1821121) (← links)
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) (Q1864566) (← links)
- On-line algorithms for ordered sets and comparability graphs (Q1894374) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs (Q1979871) (← links)
- Extremal problems and results related to Gallai-colorings (Q1981696) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Distribution of colors in Gallai colorings (Q1987082) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings (Q2005725) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Antimagicness of generalized corona and snowflake graphs (Q2018665) (← links)
- Gallai-Ramsey numbers for multiple triangles (Q2028090) (← links)
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs (Q2032988) (← links)
- On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
- The automorphism conjecture for ordered sets of dimension 2 and interval orders (Q2035093) (← links)
- Rainbow triangles in arc-colored tournaments (Q2042207) (← links)
- Edge-colored complete graphs containing no properly colored odd cycles (Q2045403) (← links)
- Editing to prime graphs (Q2049029) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Letter graphs and modular decomposition (Q2065788) (← links)
- Gallai-Ramsey number of even cycles with chords (Q2065910) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- Gallai-Ramsey number of odd cycles with chords (Q2080223) (← links)
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings (Q2084984) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs (Q2097174) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars (Q2104951) (← links)
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs (Q2112656) (← links)
- The Erdős-Hajnal conjecture for three colors and triangles (Q2113341) (← links)
- Ramsey and Gallai-Ramsey number for wheels (Q2115156) (← links)
- Note on rainbow triangles in edge-colored graphs (Q2117536) (← links)
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths (Q2118232) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Rainbow triangles in arc-colored digraphs (Q2127620) (← links)
- A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
