Subdivisions of graphs: A generalization of paths and cycles
From MaRDI portal
Recommendations
- Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs
- Degree condition for subdivisions of unicyclic graphs
- Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$
- A generalization of Dirac's theorem: subdivisions of wheels
- Subdivision extendibility
Cites work
- scientific article; zbMATH DE number 4101240 (Why is no real title available?)
- A minimum degree result for disjoint cycles and forests in graphs
- Degree conditions for 2-factors
- Graph theory
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph
- Panconnected graphs. II
- Some Theorems on Abstract Graphs
- Subtrees and subforests of graphs
Cited in
(17)- Subdivisions, parity and well-covered graphs
- Subgraph summability number of paths and cycles
- Recent advances on the Hamiltonian problem: survey III
- A generalization of Dirac's theorem: subdivisions of wheels
- scientific article; zbMATH DE number 4065028 (Why is no real title available?)
- A Dirac theorem for trestles
- Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
- Constructing the basis path set by eliminating the path dependency
- scientific article; zbMATH DE number 5919774 (Why is no real title available?)
- Subdivisions in planar graphs
- Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$
- Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs
- Pan-\(H\)-linked graphs
- Spanning subdivisions in Dirac graphs
- Subdivisions of graphs with large minimum degree
- Subdivision extendibility
- Tight bounds for divisible subdivisions
This page was built for publication: Subdivisions of graphs: A generalization of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941389)
