The following pages link to Wayne Goddard (Q186199):
Displaying 21 items.
- (Q5298903) (← links)
- Binding Number, Cycles, and Cliques (Q5378295) (← links)
- (Q5443217) (← links)
- Orientation distance graphs revisited (Q5444062) (← links)
- (Q5488327) (← links)
- (Q5488347) (← links)
- (Q5492617) (← links)
- (Q5501833) (← links)
- (Q5708583) (← links)
- Acyclic colorings of planar graphs (Q5905418) (← links)
- Pancyclicity of the prism (Q5936059) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)
- Graphs with unique minimum specified domination sets (Q6063278) (← links)
- The fully weighted toughness of a graph (Q6180647) (← links)
- Compelling Colorings: A generalization of the dominator chromatic number (Q6367162) (← links)
- Disjoint Isolating Sets and Graphs with Maximum Isolation Number (Q6516553) (← links)
- Disjoint isolating sets and graphs with maximum isolation number (Q6585250) (← links)
- The packing number of cubic graphs (Q6602335) (← links)
- Cycle-compelling colorings of graphs (Q6616821) (← links)
- Illuminating a graph. (Q6648038) (← links)
- Bounds on Coloring Trees without Rainbow Paths (Q6760764) (← links)