Header menu link for other important links
X
Degree condition for subdivisions of unicyclic graphs
, A.A. Diwan
Published in
2008
Volume: 24
   
Issue: 6
Pages: 495 - 509
Abstract
If H is any graph of order n with k non-trivial components, each of which contains at most one cycle, then every graph of order at least n and minimum degree at least n - k contains a subdivision of H such that only edges contained in a cycle in H are subdivided. © 2008 Springer Japan.
About the journal
JournalGraphs and Combinatorics
ISSN09110119