The following pages link to (Q3852212):
Displayed 50 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- The binding number of a graph and its pancyclism (Q580376) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- On some extremal connectivity results for graphs and matroids (Q594104) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Regular subgraphs of almost regular graphs (Q595688) (← links)
- Topological cliques of random graphs (Q599826) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Query strategies for priced information (Q696973) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- Girth and treewidth (Q707020) (← links)
- Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges (Q757415) (← links)
- More on the power of chain rules in context-free grammars (Q759487) (← links)
- The structure of social decision functions (Q761329) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Combinatorial dimension and random sets (Q789661) (← links)
- Lower bounds for the clique and the chromatic numbers of a graph (Q790829) (← links)
- An edge extremal result for subcohesion (Q790835) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- Girth in graphs (Q792338) (← links)
- A generalization of the Bondy-Chvátal theorem on the k-closure (Q792341) (← links)
- Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces (Q797790) (← links)
- Geometrical solution of an intersection problem for two hypergraphs (Q798334) (← links)
- The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal (Q799672) (← links)
- How to make a graph bipartite (Q805628) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Spectral radii of graphs with given chromatic number (Q868006) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Cubic maximal nontraceable graphs (Q868358) (← links)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- Eigenvalues and forbidden subgraphs. I. (Q869937) (← links)
- New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
- Minimum degree and the minimum size of \(K_2^t\)-saturated graphs (Q870972) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Graphs without minor complete subgraphs (Q878614) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- Implicit-degrees and circumferences (Q913815) (← links)
- Unique graph homomorphisms onto odd cycles. II (Q919003) (← links)