The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- On the complexity of cover-incomparability graphs of posets (Q841163) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Commutative Schur rings over symmetric groups. (Q902950) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- Colored graphs without colorful cycles (Q949751) (← links)
- \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116) (← links)
- Order extensions and the fixed point property (Q953274) (← links)
- Gallai colorings of non-complete graphs (Q966033) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- On probe permutation graphs (Q967305) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Inversions in tournaments (Q990189) (← links)
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs (Q993683) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Critically prime interval orders (Q998455) (← links)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- On minimal prime graphs and posets (Q1047188) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Comparability graphs with constraint, partial semi-orders and interval orders (Q1068108) (← links)
- Generalized complementation (Q1072574) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- A note on perfect graphs (Q1084108) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- Two classes of perfect graphs (Q1112847) (← links)
- Is there a diagram invariant? (Q1115889) (← links)
- Recognizing claw-free perfect graphs (Q1118619) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- On the X-join decomposition for undirected graphs (Q1142232) (← links)
- Stacks and splits of partially ordered sets (Q1160199) (← links)
- Partitive hypergraphs (Q1160636) (← links)
- Random orders of dimension 2 (Q1177705) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- On sources in comparability graphs, with applications (Q1208375) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
