The following pages link to Wayne Goddard (Q186199):
Displaying 50 items.
- Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
- Domination equivalence in graphs (Q2369388) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Bounds on the \(k\)-domination number of a graph (Q2430065) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- An efficient algorithm for stopping on a sink in a directed graph (Q2450610) (← links)
- Restricted domination parameters in graphs (Q2467572) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Simultaneous graph parameters: factor domination and factor total domination (Q2509300) (← links)
- Worm colorings (Q2516682) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- An algorithm for partial Grundy number on trees (Q2576842) (← links)
- A note on \(S\)-packing colorings of lattices (Q2636817) (← links)
- Compelling colorings: a generalization of the dominator chromatic number (Q2671840) (← links)
- Multipartite Ramsey numbers. (Q2715998) (← links)
- Minimal and maximal \(e=1\) functions (Q2721327) (← links)
- Average distance in colored graphs (Q2746481) (← links)
- Between packable and arbitrarily packable graphs: Packer-spoiler games (Q2768120) (← links)
- The \(S\)-packing chromatic number of a graph (Q2866422) (← links)
- A characterisation of eccentric sequences of maximal outerplanar graphs (Q2876021) (← links)
- Semitotal domination in graphs (Q2878209) (← links)
- The algorithmic complexity of domination digraphs (Q2895354) (← links)
- The disjunctive domination number of a graph (Q2968643) (← links)
- Vertex coverings by coloured induced graphs — Frames and Umbrellas (Q3024632) (← links)
- (Q3024734) (← links)
- Distance in Graphs (Q3064395) (← links)
- (Q3070232) (← links)
- Vizing's conjecture: a survey and recent results (Q3113279) (← links)
- (Q3118082) (← links)
- Defective coloring revisited (Q3122895) (← links)
- Dense graphs with small clique number (Q3168661) (← links)
- (Q3203049) (← links)
- Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph (Q3384110) (← links)
- Fractional Dominating Parameters (Q3384613) (← links)
- (Q3392285) (← links)
- (Q3429495) (← links)
- Fractional, Circular, and Defective Coloring of Series-Parallel Graphs (Q3466361) (← links)
- (Q3472139) (← links)
- (Q3490019) (← links)
- On the Toughness of a Graph (Q3490022) (← links)
- (Q3513961) (← links)
- (Q3514496) (← links)
- Distance-k Information in Self-stabilizing Algorithms (Q3613663) (← links)
- Minimal claw-free graphs (Q3624918) (← links)
- (Q3635574) (← links)
- A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES (Q3745876) (← links)
- ALL GRAPHS ON A NON-PRIME NUMBER OF VERTICES ARE DESTRUCTIBLE (Q3748314) (← links)
- On distances between isomorphism classes of graphs (Q3978523) (← links)
- A new approach to distance stable graphs (Q3980565) (← links)
