The following pages link to (Q4947393):
Displaying 50 items.
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces (Q529376) (← links)
- On graph equivalences preserved under extensions (Q536221) (← links)
- Planar groups (Q596655) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Forbidden subgraphs and the existence of spanning \(k\)-trees (Q607008) (← links)
- The contraction principle for set valued mappings on a metric space with a graph (Q611452) (← links)
- A new framework of consensus protocol design for complex multi-agent systems (Q626806) (← links)
- Random 2 XORSAT phase transition (Q627513) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- Drawn \(k\)-in-a-row games (Q638520) (← links)
- The large deviation principle for the Erdős-Rényi random graph (Q648962) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- A generalization of Menger's theorem (Q654247) (← links)
- Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics (Q654935) (← links)
- 2-factors and independent sets on claw-free graphs (Q658040) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- The \(a\) and \((a, b)\)-analogs of Zagreb indices and coindices of graphs (Q666534) (← links)
- Neighborhood equivalence for multibranched surfaces in 3-manifolds (Q670148) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- A parametric description of cities for the normative analysis of transport systems (Q681445) (← links)
- Consensus in networks with arbitrary time invariant linear agents (Q682856) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Girth and treewidth (Q707020) (← links)
- The Erdős-Menger conjecture for source/sink sets with disjoint closures (Q707026) (← links)
- On the Ramsey numbers for stars versus complete graphs (Q709240) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals (Q716459) (← links)
- On monochromatic arm exponents for 2D critical percolation (Q717879) (← links)
- Two cooperative versions of the guessing secrets problem (Q730944) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- Distance-restricted matching extension in triangulations of the torus and the Klein bottle (Q743652) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- When the line graphs of the unit, unitary and total graphs are planar and outerplanar (Q747569) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- Cyclic matrices of weighted digraphs (Q765371) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Multi-objective robust cross-market mixed portfolio optimization under hierarchical risk integration (Q781087) (← links)
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- Fano colourings of cubic graphs and the Fulkerson conjecture (Q817779) (← links)
- Using interval arithmetic to prove that a set is path-connected (Q817868) (← links)
- Centrality measures for node-weighted networks via line graphs and the matrix exponential (Q820712) (← links)
- External-memory depth-first search algorithm for solid grid graphs (Q835024) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
