The following pages link to (Q4830805):
Displaying 50 items.
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Biased graphs with no two vertex-disjoint unbalanced cycles (Q1745739) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- Enomoto and Ota's conjecture holds for large graphs (Q1756124) (← links)
- The maximal number of induced \(r\)-partite subgraphs (Q1805369) (← links)
- A note on a conjecture of Gallai (Q1805373) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Covering a graph by topological complete subgraphs (Q1813985) (← links)
- The extreme set condition of a graph (Q1861250) (← links)
- Triangle-free four-chromatic graphs (Q1901038) (← links)
- On the tacnodes of configurations of conics in the projective plane (Q1923276) (← links)
- Characterization of minimally \((2,l)\)-connected graphs (Q1944218) (← links)
- On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree (Q1949048) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- A short derivation for Turán numbers of paths (Q1990361) (← links)
- Strong chromatic index of \(k\)-degenerate graphs (Q2017054) (← links)
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems (Q2039318) (← links)
- Spectral threshold for extremal cyclic edge-connectivity (Q2053673) (← links)
- The maximum average connectivity among all orientations of a graph (Q2125229) (← links)
- On small balanceable, strongly-balanceable and omnitonal graphs (Q2158200) (← links)
- Unbreakable matroids (Q2168559) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Favourite distances in \(3\)-space (Q2185206) (← links)
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs (Q2217476) (← links)
- The multicovering radius problem for some types of discrete structures (Q2248636) (← links)
- A combinatorial characterization of finite groups of prime exponent (Q2288218) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- On \(n\)-dependence (Q2319891) (← links)
- Property testing in high-dimensional Ising models (Q2328049) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Triple placement of graphs (Q2366221) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)
- Extremal graph theory for metric dimension and diameter (Q2380462) (← links)
- An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5 (Q2392003) (← links)
- Multipodal structure and phase transitions in large constrained graphs (Q2410287) (← links)
- Acquisition-extremal graphs (Q2446335) (← links)
- A note on a packing problem in transitive tournaments (Q2502029) (← links)
- A note on short cycles in a hypercube (Q2509296) (← links)
- \(\mathcal{F}\)-saturation games (Q2515577) (← links)
- The saturation number for the length of degree monotone paths (Q2516681) (← links)
- On long cycles in a 2-connected bipartite graph (Q2563427) (← links)
- Systolic geometry of connected sums and cyclic covering. (Q2574911) (← links)
- Multicolored set multipartite Ramsey numbers (Q2629289) (← links)
- Extremal graphs for blow-ups of keyrings (Q2657053) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Distinct degrees and homogeneous sets (Q2680569) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- On the minimum number of components in a cotree of a graph (Q2702779) (← links)
