The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- Clumps, minimal asymmetric graphs, and involutions (Q1262321) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- Forbidden induced partial orders (Q1301728) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Order series of labelled posets (Q1318362) (← links)
- Mortality of iterated Gallai graphs (Q1321643) (← links)
- Incremental construction of 2-structures (Q1322177) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Indecomposable graphs (Q1367028) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On \(\text{CC}\)-comparability invariance of the fixed point property (Q1377719) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Split orders (Q1422429) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament). (Q1426559) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Reconstruction of posets with the same comparability graph (Q1569035) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- On box-perfect graphs (Q1682206) (← links)
- A graph isomorphism condition and equivalence of reaction systems (Q1682860) (← links)
- Trees and circle orders (Q1688275) (← links)
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- Necessary and possible indifferences (Q1690609) (← links)
- \(\mathcal{P}\)-apex graphs (Q1708380) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs (Q1720329) (← links)
- Gallai-Ramsey numbers of \(C_7\) with multiple colors (Q1727801) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Recent results on containment graphs of paths in a tree (Q1752490) (← links)
- Monochromatic subgraphs in the absence of a properly colored 4-cycle (Q1756081) (← links)
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs (Q1756086) (← links)
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles (Q1756099) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
