The following pages link to (Q5315023):
Displayed 50 items.
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- On the uncontrollability of nonabelian group codes with uncoded group \(\mathbb Z_p\) (Q410541) (← links)
- Nested hierarchies in planar graphs (Q411860) (← links)
- Nowhere-zero flows in Cartesian bundles of graphs (Q412278) (← links)
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Minimum rank of outerplanar graphs (Q417506) (← links)
- On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
- A short proof of the tree-packing theorem (Q418872) (← links)
- A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs (Q423951) (← links)
- On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs (Q423977) (← links)
- Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels (Q426081) (← links)
- A Dirac theorem for trestles (Q427855) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Circuits of length 5 in 2-factors of cubic graphs (Q432713) (← links)
- Embedding a mesh of trees in the crossed cube (Q436621) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- On the reconstruction of planar lattice-convex sets from the covariogram (Q443900) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- UPS delivers optimal phase diagram in high-dimensional variable selection (Q450021) (← links)
- Antimagic labeling graphs with a regular dominating subgraph (Q456149) (← links)
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements (Q533889) (← links)
- On a labeling problem in graphs (Q534336) (← links)
- The problem of singularity for planar grids (Q536216) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment (Q543889) (← links)
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830) (← links)
- Color-critical graphs have logarithmic circumference (Q550393) (← links)
- Approximation of frame based missing data recovery (Q550489) (← links)
- Line graph of combinations of generalized Bethe trees: Eigenvalues and energy (Q550615) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- Bases and closures under infinite sums (Q551324) (← links)
- A decision theory for partially consonant belief functions (Q553970) (← links)
- On the homology of locally compact spaces with ends (Q554423) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- A linear algebraic view of partition regular matrices (Q603111) (← links)
- Join-irreducible Boolean functions (Q603893) (← links)
- Rigidity and separation indices of graphs in surfaces (Q604979) (← links)
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index (Q607700) (← links)
- Balanced and 1-balanced graph constructions (Q608258) (← links)
- Compact quotients of non-Archimedean rank-one groups (Q609660) (← links)
- Affine geometry designs, polarities, and Hamada's conjecture (Q616453) (← links)
- The Max-Flow Min-Cut theorem for countable networks (Q618031) (← links)