The following pages link to (Q3586724):
Displaying 36 items.
- On multiaspect graphs (Q517022) (← links)
- Ground state properties of the SSH model (Q694608) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Topological infinite gammoids, and a new Menger-type theorem for infinite graphs (Q1671662) (← links)
- Bounds on the burning number (Q1682876) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857) (← links)
- The smallest self-dual embeddable graphs in a pseudosurface (Q1788847) (← links)
- Upper bound on the diameter of a domination dot-critical graph (Q1938885) (← links)
- Geodesic continued fractions (Q1940077) (← links)
- Strengthened chain theorems for different versions of 4-connectivity (Q2092350) (← links)
- Computing vertex-disjoint paths in large graphs using MAOs (Q2285055) (← links)
- Distributed secondary frequency control in microgrids: robustness and steady-state performance in the presence of clock drifts (Q2291151) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Classification of spherical tilings by congruent quadrangles over pseudo-double wheels. I: A special tiling by congruent concave quadrangles (Q2446421) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings (Q3297043) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Cycle flows and multistability in oscillatory networks (Q4644271) (← links)
- The strong 3-rainbow index of edge-amalgamation of some graphs (Q4970781) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Two-ended quasi-transitive graphs (Q5057726) (← links)
- (Q5091279) (← links)
- (Q5092423) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Embedding Graphs into Embedded Graphs (Q5136253) (← links)
- Multistability in lossy power grids and oscillator networks (Q5213531) (← links)
- First-Order Convergence and Roots (Q5366887) (← links)
- A UNIFIED THEORY OF TRUTH AND PARADOX (Q5381038) (← links)
- Some classifications of graphs with respect to a set adjacency relation (Q5859499) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Every rayless graph has an unfriendly partition (Q5894428) (← links)
