The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- Unique factorization of compositive hereditary graph properties (Q270251) (← links)
- Interval decomposition lattices are balanced (Q305165) (← links)
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- An antipode formula for the natural Hopf algebra of a set operad. (Q395254) (← links)
- 3-minimal triangle-free graphs (Q397131) (← links)
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
- Nash equilibria and values through modular partitions in infinite games (Q409463) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Prechains and self duality (Q418880) (← links)
- The pairs of \(\{-3\}\)-hypomorphic tournaments (Q432667) (← links)
- On the hardness of recognizing triangular line graphs (Q442382) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- The structure and metric dimension of the power graph of a finite group (Q458587) (← links)
- On structural descriptions of lower ideals of series parallel posets (Q466868) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Approximate association via dissociation (Q505447) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Gallai-Ramsey numbers for cycles (Q539886) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- Properly edge-coloured subgraphs in colourings of bounded degree (Q659683) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Sources in posets and comparability graphs (Q687177) (← links)
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- Dimension preserving contractions and a finite list of 3-irreducible posets (Q766141) (← links)
- 2-chains: An interesting family of posets (Q776317) (← links)
- The number of Gallai \(k\)-colorings of complete graphs (Q777474) (← links)
- Remarks on the distribution of colors in Gallai colorings (Q785792) (← links)
- On the number of k-realizations of an ordered set (Q804608) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
