The following pages link to (Q4507228):
Displaying 50 items.
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem (Q510905) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
- Data-driven kriging models based on FANOVA-decomposition (Q693299) (← links)
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits (Q705881) (← links)
- Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters (Q718885) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- The zero-divisor graph of a reduced ring (Q872188) (← links)
- An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology (Q883806) (← links)
- On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology (Q979376) (← links)
- The countable Erdős-Menger conjecture with ends (Q1403915) (← links)
- Structural properties for certain classes of infinite planar graphs (Q1429336) (← links)
- Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
- CHY-graphs on a torus (Q1636357) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← links)
- Topological solvability and DAE-index conditions for mass flow controlled pumps in liquid flow networks (Q1744299) (← links)
- A short proof of Halin's grid theorem (Q1766187) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Improved metaheuristics for the quartet method of hierarchical clustering (Q2022207) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Mathematical representation of Clausius' and Kelvin's statements of the second law and irreversibility (Q2183161) (← links)
- Coloring of cozero-divisor graphs of commutative von Neumann regular rings (Q2197115) (← links)
- Necessary condition for null controllability in many-server heavy traffic (Q2258536) (← links)
- Finite rings with some restrictions on zero-divisor graphs. (Q2262952) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Edge importance in a network via line graphs and the matrix exponential (Q2290932) (← links)
- Graphs preserving Wiener index upon vertex removal (Q2335728) (← links)
- Fixed points of multivalued mappings in modular function spaces with a graph (Q2343403) (← links)
- Fixed points of monotone nonexpansive mappings on a hyperbolic metric space with a graph (Q2343406) (← links)
- Fixed points of monotone nonexpansive mappings with a graph (Q2343412) (← links)
- Remarks on monotone multivalued mappings on a metric space with a graph (Q2405793) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (Q2971135) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)
- A combinatorial matrix approach for the generation of vacuum Feynman graphs multiplicities in $\phi^{4}$ theory (Q3119963) (← links)
