The following pages link to Paul S. Wenger (Q247198):
Displaying 27 items.
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs (Q456311) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- Fractional acquisition in graphs (Q741543) (← links)
- Rainbow matching in edge-colored graphs (Q976680) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the approximate shape of degree sequences that are not potentially \(H\)-graphic (Q1713791) (← links)
- The unit acquisition number of a graph (Q1732112) (← links)
- Uniquely \(C _{4}\)-saturated graphs (Q1926058) (← links)
- Conditions for families of disjoint \(k\)-connected subgraphs in a graph (Q1942666) (← links)
- List distinguishing parameters of trees (Q1946232) (← links)
- Unit hypercube visibility numbers of trees (Q2409537) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- A note on the saturation number of the family of \(k\)-connected graphs (Q2439131) (← links)
- The Unit Bar Visibility Number of a Graph (Q2800967) (← links)
- (Q2875489) (← links)
- Saturation Numbers in Tripartite Graphs (Q2978183) (← links)
- Further Results on Bar k-Visibility Graphs (Q3503232) (← links)
- Colored Saturation Parameters for Rainbow Subgraphs (Q4596322) (← links)
- Saturation numbers for families of graph subdivisions (Q4650190) (← links)
- Pancyclicity of 4‐Connected, Claw‐Free, <i>P</i><sub>10</sub>‐Free Graphs (Q4650191) (← links)
- Stability of the Potential Function (Q4684741) (← links)
- Uniquely Cycle‐Saturated Graphs (Q5272635) (← links)
- Planar Digraphs without Large Acyclic Sets (Q5272647) (← links)
- Total Acquisition in Graphs (Q5408594) (← links)
- Graph saturation in multipartite graphs (Q5963384) (← links)
- Weak dynamic coloring of planar graphs (Q6121912) (← links)
