scientific article; zbMATH DE number 3192675
From MaRDI portal
zbMath0118.18903MaRDI QIDQ5728984
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Remarks on Hamiltonian properties of powers of digraphs, Computing roots of graphs is hard, A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph, Performance guarantees for the TSP with a parameterized triangle inequality, Hamilton-laceable bi-powers of locally finite bipartite graphs, Claw-free graphs---a survey, An upper bound for the Hamiltonicity exponent of finite digraphs, Hamiltonicity in locally finite graphs: two extensions and a counterexample, On winning Ehrenfeucht games and monadic NP, Real-time emulations of bounded-degree networks, A generalization of Hamiltonian cycles for trees, Fixed parameter tractability of a biconnected bottleneck Steiner network problem, Data encodings and their costs, 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, Invariant spanning double rays in amenable groups, Single-source three-disjoint path covers in cubes of connected graphs, Disjoint path covers in cubes of connected graphs, Spanning connectivity of the power of a graph and Hamilton-connected index of a graph, Unnamed Item, A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph, Superhamiltonian 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, On \(k\)-path pancyclic graphs, Path extendable graphs, Edge-disjoint 1-factors in powers of connected graphs
