Subdivision extendibility
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3156013 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 5036076 (Why is no real title available?)
- A method in graph theory
- Degree conditions for 2-factors
- Distance between two \(k\)-sets and path-systems extendibility.
- Hamilton connected graphs
- Linear forests and ordered cycles
- Non-Separable and Planar Graphs
- Note on Hamilton Circuits
- On \(H\)-linked graphs
- Onk-ordered graphs
- Some Theorems on Abstract Graphs
- Survey of results on \(k\)-ordered graphs
- Vertex-disjoint cycles containing specified edges
- k-ordered Hamiltonian graphs
Cited in
(10)- Pan-\(H\)-linked graphs
- Degree sum and graph linkage with prescribed path lengths
- Recent advances on the Hamiltonian problem: survey III
- Note on semi-linkage with almost prescribed lengths in large graphs
- Minimum degree and pan-\(k\)-linked graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On large semi-linked graphs
- Spanning subdivisions in Dirac graphs
- Stationary subdivision
- Subdivisions of graphs: A generalization of paths and cycles
This page was built for publication: Subdivision extendibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879940)