Subdivisions of graphs: A generalization of paths and cycles

DOI10.1016/j.disc.2007.08.045zbMath1159.05032OpenAlexW1975855634MaRDI QIDQ941389

Ajit A. Diwan, Ch. Sobhan Babu

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.045

zbMATH Keywords

unicyclic graphsminimum degree conditionspanning subdivision

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs, Recent advances on the Hamiltonian problem: survey III, Constructing the basis path set by eliminating the path dependency

Cites Work

• Unnamed Item
• Unnamed Item
• Panconnected graphs. II
• A minimum degree result for disjoint cycles and forests in graphs
• On the existence of disjoint cycles in a graph
• Subtrees and subforests of graphs
• Degree conditions for 2-factors
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs