The following pages link to (Q2758332):
Displaying 38 items.
- Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- From monomials to words to graphs. (Q598451) (← links)
- Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Gallai colorings of non-complete graphs (Q966033) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- Extension of hereditary classes with substitutions (Q1811128) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- Editing to prime graphs (Q2049029) (← links)
- Letter graphs and modular decomposition (Q2065788) (← links)
- Prime orientable graphs (Q2237224) (← links)
- The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- A matrix description of weakly bipartitive and bipartitive families (Q2404970) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- A finiteness theorem for primal extensions (Q2484373) (← links)
- Gallai-Ramsey numbers for a class of graphs with five vertices (Q2657034) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- 3-uniform hypergraphs: modular decomposition and realization by tournaments (Q3303522) (← links)
- (Q4963168) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- (Q5708495) (← links)
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs (Q5859844) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
- Permutation graphs and the weak Bruhat order (Q5888419) (← links)
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product (Q5902101) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← links)
