On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
From MaRDI portal
Publication:2558869
Cites work
- scientific article; zbMATH DE number 3303829 (Why is no real title available?)
- scientific article; zbMATH DE number 3192675 (Why is no real title available?)
- On a certain ordering of the vertices of a tree
- ON ORDERING OF THE SYSTEM OF ALL SUBSETS OF A GIVEN SET
- Parallel concepts in graph theory
- Über HAMILTONsche Linien im Quadrat kubischer und pseudokubischer Graphen
Cited in
(20)- Hamiltonicity in vertex envelopes of plane cubic graphs
- A short proof of Fleischner's theorem
- A new proof of the theorem by Fleischner
- 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 a block is Hamiltonian connected
- The connectivity of acyclic orientation graphs
- Edge-pancyclicity of coupled graphs
- The square of a block is strongly path connected
- Vertex-pancyclicity of edge-face-total graphs
- A best possible result for the square of a 2-block to be Hamiltonian
- The square of every two-connected graph is Hamiltonian
- Performance guarantees for the TSP with a parameterized triangle inequality
- Hamiltonicity and pancyclicity of generalized prisms
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- The most general structure of graphs with Hamiltonian or Hamiltonian connected square
- Dead ends on wreath products and lamplighter groups
- Decompositions and packings in truncated triangulations
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
This page was built for publication: On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558869)
