
doi: 10.1002/jgt.22818
AbstractWe prove that every graph of minimum degree at least contains a subdivision of some maximal 3‐degenerate graph of order . This generalizes the classic results of Dirac () and Pelikán (). We conjecture that for any planar maximal 3‐degenerate graph of order , every graph of minimum degree at least contains a subdivision of . We verify this in the case is and .
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
