Pages that link to "Item:Q2558869"
From MaRDI portal
The following pages link to On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs (Q2558869):
Displayed 19 items.
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph (Q489324) (← links)
- Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658) (← links)
- Hamiltonicity in vertex envelopes of plane cubic graphs (Q1044951) (← links)
- A short proof of Fleischner's theorem (Q1045203) (← links)
- A new proof of the theorem by Fleischner (Q1179471) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- A necessary condition for the square of a graph to be Hamiltonian (Q1220945) (← links)
- The square of a block is vertex pancyclic (Q1223431) (← links)
- The square of a block is Hamiltonian connected (Q1393413) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Edge-pancyclicity of coupled graphs (Q1613351) (← links)
- The square of a block is strongly path connected (Q1844686) (← links)
- Vertex-pancyclicity of edge-face-total graphs (Q1887075) (← links)
- A best possible result for the square of a 2-block to be Hamiltonian (Q2219950) (← links)
- The square of every two-connected graph is Hamiltonian (Q2558870) (← links)
- Hamiltonicity and pancyclicity of generalized prisms (Q3439413) (← links)
- The most general structure of graphs with Hamiltonian or Hamiltonian connected square (Q6080167) (← links)
- Dead ends on wreath products and lamplighter groups (Q6142825) (← links)