The following pages link to R. J. Nowakowski (Q215016):
Displaying 50 items.
- Guaranteed scoring games (Q311536) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Misère-play Hackenbush sprigs (Q328573) (← links)
- On the location of roots of independence polynomials (Q596652) (← links)
- Cleaning with brooms (Q659685) (← links)
- Edge critical cops and robber (Q708375) (← links)
- Lattices of games (Q766145) (← links)
- (Q799697) (redirect page) (← links)
- (Q186124) (redirect page) (← links)
- (Q1110535) (redirect page) (← links)
- A Helly theorem for convexity in graphs (Q799698) (← links)
- The robot cleans up (Q849139) (← links)
- The well-covered dimension of random graphs (Q864120) (← links)
- Research problems from the 5th Slovenian Conference (Bled, 2003) (Q864155) (← links)
- Retract rigid Cartesian products of graphs (Q912867) (← links)
- Ordered sets, pagenumbers and planarity (Q913833) (← links)
- Representing orders on the plane by translating points and lines (Q921023) (← links)
- Cleaning a network with brushes (Q930892) (← links)
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions (Q965231) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- Chip firing and all-terminal network reliability bounds (Q1040088) (← links)
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles (Q1043816) (← links)
- Cutsets of Boolean lattices (Q1086269) (← links)
- The chromatic connectivity of graphs (Q1110536) (← links)
- A characterization of well covered graphs of girth 5 or greater (Q1204485) (← links)
- Lattices contained in planar orders are planar (Q1208077) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- The independence fractal of a graph. (Q1405113) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- Game comparison through play (Q1748992) (← links)
- Average independence polynomials (Q1767674) (← links)
- Wythoff partizan subtraction (Q1791294) (← links)
- Games with guaranteed scores and waiting moves (Q1791295) (← links)
- Vertex-to-vertex pursuit in a graph (Q1837707) (← links)
- The smallest graph variety containing all paths (Q1838985) (← links)
- On a class of isometric subgraphs of a graph (Q1839266) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Periodicity and arithmetic-periodicity in hexadecimal games (Q1885005) (← links)
- Distributive online channel assignment for hexagonal cellular networks with constraints (Q1887044) (← links)
- The endomorphism spectrum of an ordered set (Q1917669) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- Corrigendum to: ``The orthogonal colouring game'' (Q2006785) (← links)
- Atomic weights and the combinatorial game of \textsc{bipass} (Q2099475) (← links)
- Bounding game temperature using confusion intervals (Q2220877) (← links)
- Three-player \textsc{nim} with podium rule (Q2230539) (← links)
- On lattices from combinatorial game theory: infinite case (Q2230543) (← links)
- Simplicial complexes are game complexes (Q2318782) (← links)
