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