Cited in
(37)- Superhamiltonian graphs
- Claw-free graphs---a survey
- 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
- Euclidean bottleneck bounded-degree spanning tree ratios
- Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
- Single-source three-disjoint path covers in cubes of connected graphs
- Disjoint path covers in cubes of connected graphs
- Balanced graph partitions
- Infinite Hamilton cycles in squares of locally finite graphs
- Graphs with 1-hamiltonian-connected cubes
- The 2-hamiltonian cubes of graphs
- Hamiltonian properties of the cube of a 2-edge connected graph
- Über zusammenhängende Graphen mitp-hamiltonscher (p + 1)-ter Potenz (p ≧ 4)
- Eine Charakterisierung der Graphen, deren dritte Potenz 2-hamiltonsch ist
- Some recent results in hamiltonian graphs
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- Strongly aperiodic subshifts of finite type on hyperbolic groups
- Algorithms for Euclidean degree bounded spanning tree problems
- On the largest tree of given maximum degree in a connected graph
- Uniform d‐emulations of rings, with an application to distributed virtual ring construction
- Trees with Hamiltonian square
- Eine Eigenschaft der dritten Potenz brückenloser Graphen
- Verallgemeinerung eines Satzes von CHARTRAND und KAPOOR über Potenzen zusammenhängender Graphen
- 1-(edge-)trail-connected square tree
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- Graph theory
- scientific article; zbMATH DE number 7758357 (Why is no real title available?)
- The Clustered Selected-Internal Steiner Tree Problem
- Dead ends on wreath products and lamplighter groups
- Hamilton powers of Eulerian digraphs
- Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Exponentiation of graphs
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- 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: On the Cube of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545844)
