The following pages link to (Q5520566):
Displaying 50 items.
- Cycle-connected graphs (Q1201258) (← links)
- Graphs from projective planes (Q1224106) (← links)
- Ramsey graphs and block designs (Q1224586) (← links)
- A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares (Q1244252) (← links)
- Radius, diameter, and minimum degree (Q1262322) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- Norm-graphs: Variations and applications (Q1306316) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- A graph-theoretic result for a model of neural computation (Q1383384) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- On completely positive graphs and their complements (Q1406281) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- Impossibility of order-revealing encryption in idealized models (Q1631321) (← links)
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\) (Q1633285) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- Two-regular subgraphs of odd-uniform hypergraphs (Q1682214) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Bipartite algebraic graphs without quadrilaterals (Q1744742) (← links)
- A family of graphs that are determined by their normalized Laplacian spectra (Q1748074) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) (← links)
- Some geometric structures and bounds for Ramsey numbers (Q1827669) (← links)
- Graphs without quadrilaterals (Q1835928) (← links)
- Cycles of even length in graphs (Q1844243) (← links)
- One method for proving the impossibility of certain Moore graphs (Q1845742) (← links)
- On generalized Ramsey theory: The bipartite case (Q1850469) (← links)
- A variation of a classical Turán-type extremal problem (Q1883610) (← links)
- On product representation of powers. I (Q1902964) (← links)
- The number of 2-dominating sets, and 2-domination polynomial of a graph (Q2030139) (← links)
- Steiner diameter, maximum degree and size of a graph (Q2032893) (← links)
- Some extremal results on 4-cycles (Q2033916) (← links)
- On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- Optimal monomial quadratization for ODE systems (Q2115847) (← links)
- \(C_4\)-free subgraphs with large average degree (Q2130532) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals (Q2144519) (← links)
- Some extremal results on hypergraph Turán problems (Q2158853) (← links)
- First-order network coherence in 5-rose graphs (Q2161709) (← links)
- The number of copies of \(K_{2,t+1}\) in a graph (Q2164991) (← links)
- Forbidding multiple copies of forestable graphs (Q2175780) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs (Q2198988) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
- A spectral version of Mantel's theorem (Q2237213) (← links)
- Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs (Q2304394) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
