The square of every two-connected graph is Hamiltonian
From MaRDI portal
Publication:2558870
DOI10.1016/0095-8956(74)90091-4zbMath0256.05121OpenAlexW2028413050MaRDI QIDQ2558870
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(74)90091-4
Related Items
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem, Remarks on Hamiltonian properties of powers of digraphs, Computing roots of graphs is hard, Performance guarantees for the TSP with a parameterized triangle inequality, Hamilton-laceable bi-powers of locally finite bipartite graphs, Induced cycle path number of derived graphs, On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs, An upper bound for the Hamiltonicity exponent of finite digraphs, Hamiltonicity in locally finite graphs: two extensions and a counterexample, Extremal problems on the Hamiltonicity of claw-free graphs, An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement, Cycles through all finite vertex sets in infinite graphs, A short proof of the versatile version of Fleischner's theorem, Cycles in squares of trees without generalized claws, The square of a block is Hamiltonian connected, A generalization of Hamiltonian cycles for trees, The most general structure of graphs with Hamiltonian or Hamiltonian connected square, Ore's condition for completely independent spanning trees, Strong connectivity of sensor networks with double antennae, Dead ends on wreath products and lamplighter groups, Unnamed Item, Star subdivisions and connected even factors in the square of a graph, On hamiltonian circuits in Cayley diagrams, On the sizes of graphs and their powers: the undirected case, Single-source three-disjoint path covers in cubes of connected graphs, Hamilton cycles in dense vertex-transitive graphs, A best possible result for the square of a 2-block to be Hamiltonian, Disjoint path covers in cubes of connected graphs, Graphs whose complement and square are isomorphic, Heavy subgraph pairs for traceability of block-chains, A new proof of the theorem by Fleischner, The circumference of the square of a connected graph, Spanning connectivity of the power of a graph and Hamilton-connected index of a graph, Trestles in the squares of graphs, Traveling salesman problem under categorization, A localization method in Hamiltonian graph theory, Some recent results in hamiltonian graphs, Number of vertices of degree three in spanning 3-trees in square graphs, A necessary condition for the square of a graph to be Hamiltonian, Toughness in graphs -- a survey, The square of a block is vertex pancyclic, The entire graph of a bridgeless connected plane graph is Hamiltonian, Finding cut-vertices in the square roots of a graph, On graphs with Hamiltonian squares, Various results on the toughness of graphs, A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph, Maximal Hamiltonian cycles in squares of graphs, Hamilton circles in infinite planar graphs, Infinite Hamilton cycles in squares of locally finite graphs, Extending cycles in graphs, Euclidean bottleneck bounded-degree spanning tree ratios, On the intersection graph of random caps on a sphere, On graphs whose square have strong Hamiltonian properties, Hamiltonian paths in Cayley graphs, Hamiltonicity in vertex envelopes of plane cubic graphs, A short proof of Fleischner's theorem, Guaranteed performance heuristics for the bottleneck traveling salesman problem, The connectivity of acyclic orientation graphs, The square of a block is strongly path connected, Chvátal’s t 0-Tough Conjecture, Unnamed Item, On `maximal' Hamiltonian cycles in the square of a block, On \(k\)-path pancyclic graphs, Triangle-factors in powers of graphs, On a condition for the union of spherical caps to be connected
Cites Work
