On the Cube of a Graph
From MaRDI portal
Publication:5545844
DOI10.4153/CMB-1968-037-0zbMath0162.27701MaRDI QIDQ5545844
Publication date: 1968
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
Uniform d‐emulations of rings, with an application to distributed virtual ring construction, A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph, Claw-free graphs---a survey, Hamiltonicity in locally finite graphs: two extensions and a counterexample, The 2-hamiltonian cubes of graphs, Trees with Hamiltonian square, Strongly aperiodic subshifts of finite type on hyperbolic groups, Eine Eigenschaft der dritten Potenz brückenloser Graphen, The Clustered Selected-Internal Steiner Tree Problem, Dead ends on wreath products and lamplighter groups, Verallgemeinerung eines Satzes von CHARTRAND und KAPOOR über Potenzen zusammenhängender Graphen, Unnamed Item, Eine Charakterisierung der Graphen, deren dritte Potenz 2-hamiltonsch ist, Unnamed Item, Single-source three-disjoint path covers in cubes of connected graphs, Disjoint path covers in cubes of connected graphs, Hamiltonian properties of the cube of a 2-edge connected graph, Spanning connectivity of the power of a graph and Hamilton-connected index of a graph, Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\), Balanced graph partitions, Some recent results in hamiltonian graphs, Über zusammenhängende Graphen mitp-hamiltonscher (p + 1)-ter Potenz (p ≧ 4), Algorithms for Euclidean Degree Bounded Spanning Tree Problems, Graph theory, On the largest tree of given maximum degree in a connected graph, 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, Euclidean bottleneck bounded-degree spanning tree ratios, Graphs with 1-hamiltonian-connected cubes, 1-(edge-)trail-connected square tree, Path extendable graphs
