A minimum degree condition for wheels

MaRDI QIDQ2732628zbMATH OpenFDO

Authors Connie M. Campbell, William Staton

Publication date 29 July 2001

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

minimum degreewheel

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Review text

Let \(v\) be a node of a graph \(G\) with \(n\geq 4\) nodes. The authors show that if \(d(v)+ d(u)\geq n+2\) for every neighbour \(u\) of \(v\), then \(v\) is the centre of a wheel in \(G\).

Recommendations

• Odd wheels in graphs
• Cycle‐minors and subdivisions of wheels
• The subgraph homeomorphism problem for small wheels
• scientific article; zbMATH DE number 4070952
• Cycles through specified vertices

Cited in

(1)

• Odd wheels in graphs

This page was built for publication: A minimum degree condition for wheels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732628)