Subdivision extendibility
DOI10.1007/S00373-006-0665-0zbMATH Open1115.05063OpenAlexW2913969033MaRDI QIDQ879940FDOQ879940
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?)
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
- Survey of results on \(k\)-ordered graphs
- A method in graph theory
- Vertex-disjoint cycles containing specified edges
- Degree conditions for 2-factors
- On \(H\)-linked graphs
- Linear forests and ordered cycles
- Hamilton connected graphs
- k-ordered Hamiltonian graphs
- Title not available (Why is that?)
- Onk-ordered graphs
- Non-Separable and Planar Graphs
- Title not available (Why is that?)
- Distance between two \(k\)-sets and path-systems extendibility.
Cited In (7)
- Pan-\(H\)-linked graphs
- Recent advances on the Hamiltonian problem: survey III
- 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
- 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)
