The following pages link to (Q5315023):
Displayed 50 items.
- Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach (Q493717) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- On the inertia set of a signed tree with loops (Q501253) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Union of distance magic graphs (Q503682) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- On the \(H\)-force number of Hamiltonian graphs and cycle extendability (Q505468) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- A family of \(\omega_1\) topological types of locally finite trees (Q507508) (← links)
- On non-self-referential fragments of modal logics (Q508827) (← links)
- Near packings of two graphs (Q512568) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- Networked control design for coalitional schemes using game-theoretic methods (Q518344) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- The price of anarchy in bilateral network formation in an adversary model (Q521821) (← links)
- \(k\)-sum decomposition of strongly unimodular matrices (Q526424) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← 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)