scientific article; zbMATH DE number 3192675

Cited in

(33)

Real-time emulations of bounded-degree networks
Data encodings and their costs
Superhamiltonian graphs
Remarks on Hamiltonian properties of powers of digraphs
Computing roots of graphs is hard
Claw-free graphs---a survey
An upper bound for the Hamiltonicity exponent of finite digraphs
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
Hamiltonicity in locally finite graphs: two extensions and a counterexample
On winning Ehrenfeucht games and monadic NP
Hamilton-laceable bi-powers of locally finite bipartite graphs
Invariant spanning double rays in amenable groups
On \(k\)-path pancyclic graphs
Single-source three-disjoint path covers in cubes of connected graphs
Disjoint path covers in cubes of connected graphs
Infinite Hamilton cycles in squares of locally finite graphs
Graphs with 1-hamiltonian-connected cubes
On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
Performance guarantees for the TSP with a parameterized triangle inequality
Edge-disjoint 1-factors in powers of connected graphs
A generalization of Hamiltonian cycles for trees
Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
scientific article; zbMATH DE number 3303829 (Why is no real title available?)
Fixed parameter tractability of a biconnected bottleneck Steiner network problem
The Clustered Selected-Internal Steiner Tree Problem
Dead ends on wreath products and lamplighter groups
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
Hamilton powers of Eulerian digraphs
On a traveling salesman problem for points in the unit cube
Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
Exponentiation of graphs
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Path extendable graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5728984)