The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels (Q2166308) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs (Q2197400) (← links)
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges (Q2197415) (← links)
- Gallai-Ramsey numbers for graphs with chromatic number three (Q2231752) (← links)
- Choice resolutions (Q2235096) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) (Q2248724) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Density of Gallai multigraphs (Q2256125) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments (Q2271991) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Gallai-Ramsey numbers for books (Q2274089) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- A note on Gallai-Ramsey number of even wheels (Q2286586) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- Interval orders, semiorders and ordered groups (Q2332813) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Tree-width and dimension (Q2400108) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- A matrix description of weakly bipartitive and bipartitive families (Q2404970) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Complete graphs and complete bipartite graphs without rainbow path (Q2421879) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- Forbidden graphs for classes of split-like graphs (Q2441949) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- A decomposition of Gallai multigraphs (Q2450129) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
