On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
From MaRDI portal
Publication:2558869
DOI10.1016/0095-8956(74)90090-2zbMath0256.05120OpenAlexW2061728308MaRDI QIDQ2558869
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)90090-2
Related Items
Edge-pancyclicity of coupled graphs ⋮ Performance guarantees for the TSP with a parameterized triangle inequality ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ The square of a block is Hamiltonian connected ⋮ The most general structure of graphs with Hamiltonian or Hamiltonian connected square ⋮ Dead ends on wreath products and lamplighter groups ⋮ A best possible result for the square of a 2-block to be Hamiltonian ⋮ A new proof of the theorem by Fleischner ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem ⋮ A necessary condition for the square of a graph to be Hamiltonian ⋮ The square of a block is vertex pancyclic ⋮ The square of every two-connected graph is Hamiltonian ⋮ 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 ⋮ Hamiltonicity and pancyclicity of generalized prisms
Cites Work
