Subdivision extendibility
DOI10.1007/S00373-006-0665-0zbMATH Open1115.05063OpenAlexW2913969033MaRDI QIDQ879940FDOQ879940
Authors: Ronald Gould, Thor Whalen 
Publication date: 10 May 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0665-0
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Spanning subdivisions in Dirac graphs
- On large semi-linked 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)
