The following pages link to (Q3852212):
Displayed 50 items.
- Edge reductions in cyclically \(k\)-connected cubic graphs (Q922553) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Disjoint unions of complete minors (Q941374) (← links)
- Planar Ramsey numbers for cycles (Q941377) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- Graphs with the maximum or minimum number of 1-factors (Q965940) (← links)
- Large induced subgraphs with equated maximum degree (Q965950) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian (Q968148) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) (Q982621) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
- Factor-critical graphs with given number of maximum matchings (Q1015441) (← links)
- Combinatorial designs and the theorem of Weil on multiplicative character sums (Q1017416) (← links)
- Large disjoint subgraphs with the same order and size (Q1024273) (← links)
- Constructions of bi-regular cages (Q1024448) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- On cyclic edge-connectivity of transitive graphs (Q1043988) (← links)
- Stability of the path-path Ramsey number (Q1043993) (← links)
- Ordered colourings of graphs (Q1052329) (← links)
- On the maximum density of graphs which have no subcontraction to \(K^ r\). (Q1053033) (← links)
- A note on the probabilistic approach to Turan's problem (Q1054749) (← links)
- Minimally k-connected graphs of low order and maximal size (Q1055785) (← links)
- On color critical graphs (Q1059085) (← links)
- Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph (Q1063975) (← links)
- An extremal problem for sets with applications to graph theory (Q1066141) (← links)
- Every poset has a central element (Q1068859) (← links)
- Factors of regular graphs (Q1074601) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- Time-space trade-offs for branching programs (Q1076517) (← links)
- The complexity of colouring problems on dense graphs (Q1079363) (← links)
- Minimally 3-connected graphs (Q1080868) (← links)