The following pages link to (Q3374865):
Displayed 50 items.
- Selecting and estimating regular vine copulae and application to financial returns (Q80568) (← links)
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Graphs with no \(\bar{P}_7\)-minor (Q281612) (← links)
- Rainbow connection number of amalgamation of some graphs (Q322063) (← links)
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Excluding clocks (Q324738) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- On doubly light triangles in plane graphs (Q383767) (← links)
- On spanning tree packings of highly edge connected graphs (Q401495) (← links)
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) (Q412061) (← links)
- Hexagonal resonance of (3,6)-fullerenes (Q424211) (← links)
- Modeling the topology of a dynamical network via Wiener filtering approach (Q445916) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Avoiding 7-circuits in 2-factors of cubic graphs (Q470948) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- Controllability of system dynamics on networks, quantum walks and random walks (Q490598) (← links)
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← links)
- On non-normal arc-transitive 4-valent dihedrants (Q606297) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Unavoidable topological minors of infinite graphs (Q607009) (← links)
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' (Q611943) (← links)
- Jacobians of nearly complete and threshold graphs (Q648992) (← links)
- Collaborative software infrastructure for adaptive multiple model simulation (Q649340) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Some properties of \(k\)-trees (Q708399) (← links)
- Linked tree-decompositions of represented infinite matroids (Q716055) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- 4-factor-criticality of vertex-transitive graphs (Q726659) (← links)
- The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs (Q744112) (← links)
- Nice pairs of disjoint pentagons in fullerene graphs (Q830887) (← links)
- A characterization of signed graphs with generalized perfect elimination orderings (Q965961) (← links)
- Hajós' conjecture and cycle power graphs (Q966132) (← links)
- Quantitative noise sensitivity and exceptional times for percolation (Q974053) (← links)
- One-matching bi-Cayley graphs over Abelian groups (Q1003613) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Regular Steinhaus graphs of odd degree (Q1043987) (← links)
- Excessive near 1-factorizations (Q1044935) (← links)
- Embeddings into almost self-centered graphs of given radius (Q1631688) (← links)
- The signless Laplacian spectral radius of \(k\)-connected irregular graphs (Q1642003) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Excluding a full grid minor (Q1688263) (← links)
- On finite rings in which nilpotent graphs satisfy the Dirac's condition (Q1750793) (← links)
- Coverings and homotopy of a graph (Q1752673) (← links)
- Measurable chromatic and independence numbers for ergodic graphs and group actions (Q1943731) (← links)
- Three conjectures on the signed cycle domination in graphs (Q1956250) (← links)
- Paths to trees and cacti (Q1998842) (← links)