The following pages link to Wayne Goddard (Q186199):
Displaying 19 items.
- Vertex colorings without rainbow subgraphs (Q339490) (← links)
- A note on extremal values of the scattering number (Q384905) (← links)
- Independent dominating sets in triangle-free graphs (Q434189) (← links)
- The graph distance game (Q647238) (← links)
- Minimum degree conditions for cycles including specified sets of vertices (Q704845) (← links)
- The generalized matcher game (Q777420) (← links)
- Domination and dominator colorings in planar graphs with small diameter (Q833001) (← links)
- Vizing's conjecture: a survey and recent results (Q3113279) (← links)
- On distances between isomorphism classes of graphs (Q3978523) (← links)
- Thoroughly dispersed colorings (Q4575525) (← links)
- Multiple vertex coverings by cliques (Q4667797) (← links)
- Hereditary domination and independence parameters (Q4669431) (← links)
- Offensive alliances in graphs (Q4669433) (← links)
- A note on trees, tables, and algorithms (Q5191139) (← links)
- Distributed Computing - IWDC 2003 (Q5191414) (← links)
- High Performance Computing - HiPC 2003 (Q5193153) (← links)
- Orientation distance graphs revisited (Q5444062) (← links)
- Graphs with unique minimum specified domination sets (Q6063278) (← links)
- The fully weighted toughness of a graph (Q6180647) (← links)
