The following pages link to Wendy J. Myrvold (Q1338580):
Displaying 50 items.
- (Q553950) (redirect page) (← links)
- (Q1603396) (redirect page) (← links)
- Computational determination of (3,11) and (4,7) cages (Q553952) (← links)
- Ovals and hyperovals in nets (Q557076) (← links)
- Errors in graph embedding algorithms (Q632808) (← links)
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s (Q1025559) (← links)
- The degree sequence is reconstructible from \(n-1\) cards (Q1193716) (← links)
- Reliability polynomials can cross twice (Q1338581) (← links)
- Ranking and unranking permutations in linear time (Q1603397) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8 (Q1876078) (← links)
- Nets of small degree without ovals (Q1877349) (← links)
- Counterexamples to a proposed algorithm for fries structures of benzenoids (Q1930506) (← links)
- Generating simple convex Venn diagrams (Q1932372) (← links)
- A linear time algorithm for finding a maximum independent set of a fullerene (Q2364862) (← links)
- The special cuts of the \(600\)-cell (Q2473596) (← links)
- (Q2816126) (← links)
- (Q3012461) (← links)
- Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams (Q3111657) (← links)
- Uniformly-most reliable networks do not always exist (Q3354450) (← links)
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition (Q3378497) (← links)
- Small latin squares, quasigroups, and loops (Q3427365) (← links)
- Forbidden minors and subdivisions for toroidal graphs with no K3,3's (Q3439326) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- (Q3483308) (← links)
- The ally-reconstruction number of a tree with five or more vertices is three (Q3483309) (← links)
- (Q3720617) (← links)
- Bidegreed graphs are edge reconstructible (Q3809831) (← links)
- (Q3813587) (← links)
- Countingk-component forests of a graph (Q4022730) (← links)
- (Q4243054) (← links)
- (Q4250180) (← links)
- (Q4252282) (← links)
- Maximizing spanning trees in almost complete graphs (Q4355482) (← links)
- Maximizing spanning trees in almost complete graphs (Q4361180) (← links)
- (Q4470340) (← links)
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs (Q4604531) (← links)
- (Q4873766) (← links)
- Two Algorithms for Unranking Arborescences (Q4876694) (← links)
- (Q5298912) (← links)
- (Q5365030) (← links)
- Maximum independent sets of the 120-cell and other regular polytopes (Q5415700) (← links)
- (Q5454403) (← links)
- (Q5454405) (← links)
- (Q5463581) (← links)
- (Q5477973) (← links)
- (Q5501836) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)
- Proving exact values for the $2$-limited broadcast domination number on grid graphs (Q6507645) (← links)
- Cordial forests (Q6546601) (← links)
- Proving exact values for the \(2\)-limited broadcast domination number on grid graphs (Q6599802) (← links)
